-
1
-
-
0035465539
-
Inverse optimization
-
R. K. Ahuja J. B. Orlin 2001 Inverse optimization Operations Research 49 771 783 10.1287/opre.49.5.771.10607 (Pubitemid 34011327)
-
(2001)
Operations Research
, vol.49
, Issue.5
, pp. 771-783
-
-
Ahuja, R.K.1
Orlin, J.B.2
-
3
-
-
70349682457
-
Inverse scheduling with maximum lateness objective
-
10.1007/s10951-009-0117-9
-
P. Brucker N. V. Shakhlevich 2009 Inverse scheduling with maximum lateness objective Journal of Scheduling 12 475 488 10.1007/s10951-009-0117-9
-
(2009)
Journal of Scheduling
, vol.12
, pp. 475-488
-
-
Brucker, P.1
Shakhlevich, N.V.2
-
4
-
-
27744569242
-
Some inverse optimization problems under the Hamming distance
-
DOI 10.1016/j.ejor.2004.07.059, PII S0377221704005624
-
C. W. Duin A. Volgenant 2006 Some inverse optimization problems under the Hamming distance European Journal of Operational Research 170 887 899 10.1016/j.ejor.2004.07.059 (Pubitemid 41607642)
-
(2006)
European Journal of Operational Research
, vol.170
, Issue.3
, pp. 887-899
-
-
Duin, C.W.1
Volgenant, A.2
-
6
-
-
4344609663
-
Inverse combinatorial optimization: A survey on problems, methods and results
-
10.1023/B:JOCO.0000038914.26975.9b
-
C. Heuberger 2004 Inverse combinatorial optimization: a survey on problems, methods and results Journal of Combinatorial Optimization 8 329 361 10.1023/B:JOCO.0000038914.26975.9b
-
(2004)
Journal of Combinatorial Optimization
, vol.8
, pp. 329-361
-
-
Heuberger, C.1
-
7
-
-
58149363429
-
About strongly polynomial time algorithms for quadratic optimization over submodular constraints
-
D. S. Hochbaum S.-P. Hong 1995 About strongly polynomial time algorithms for quadratic optimization over submodular constraints Mathematical Programming 69 269 309
-
(1995)
Mathematical Programming
, vol.69
, pp. 269-309
-
-
Hochbaum, D.S.1
Hong, S.-P.2
-
8
-
-
0003075019
-
On two and three-stage production scheduling with setup times included
-
10.1002/nav.3800010110
-
S. M. Johnson 1954 On two and three-stage production scheduling with setup times included Naval Research Logistics Quarterly 1 61 67 10.1002/nav.3800010110
-
(1954)
Naval Research Logistics Quarterly
, vol.1
, pp. 61-67
-
-
Johnson, S.M.1
-
9
-
-
0011688772
-
Resource allocation problems
-
D.-Z. Du P. M. Pardalos (eds). Kluwer Academic Dordrecht
-
Katoh, N.; & Ibaraki, T. (1998). Resource allocation problems. In Du, D.-Z.; & Pardalos, P. M. (Eds.), Handbook of combinatorial optimization (Vol. 2, pp. 159-260). Dordrecht: Kluwer Academic.
-
(1998)
Handbook of Combinatorial Optimization
, vol.2
, pp. 159-260
-
-
Katoh, N.1
Ibaraki, T.2
-
11
-
-
33749545026
-
Necessary and sufficient conditions of optimality for some classical scheduling problems
-
DOI 10.1016/j.ejor.2005.09.017, PII S0377221705007198
-
Y. Lin X. Wang 2007 Necessary and sufficient conditions of optimality for some classical scheduling problems European Journal of Operational Research 176 809 818 10.1016/j.ejor.2005.09.017 (Pubitemid 44537623)
-
(2007)
European Journal of Operational Research
, vol.176
, Issue.2
, pp. 809-818
-
-
Lin, Y.1
Wang, X.2
-
12
-
-
33749612912
-
Inverse maximum flow problems under the weighted Hamming distance
-
DOI 10.1007/s10878-006-9006-8, Special Issue In Memoriam: Yong He (1969-2005)
-
L. C. Liu J. Z. Zhang 2006 Inverse maximum flow problems under the weighted Hamming distance Journal of Combinatorial Optimization 12 395 408 10.1007/s10878-006-9006-8 (Pubitemid 44546697)
-
(2006)
Journal of Combinatorial Optimization
, vol.12
, Issue.4
, pp. 394-407
-
-
Liu, L.1
Zhang, J.2
-
14
-
-
60749134950
-
Cutting plane algorithms for the inverse mixed integer linear programming problem
-
10.1016/j.orl.2008.12.001
-
L. Z. Wang 2009 Cutting plane algorithms for the inverse mixed integer linear programming problem Operations Research Letters 37 114 116 10.1016/j.orl.2008.12.001
-
(2009)
Operations Research Letters
, vol.37
, pp. 114-116
-
-
Wang, L.Z.1
|