-
1
-
-
13944271956
-
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
-
Adams, W.P., R.J. Forrester, and F.W. Glover. (2004). "Comparisons and Enhancement Strategies for Linearizing Mixed 0-1 Quadratic Programs." Discrete Optimization 1, 99-120.
-
(2004)
Discrete Optimization
, vol.1
, pp. 99-120
-
-
Adams, W.P.1
Forrester, R.J.2
Glover, F.W.3
-
2
-
-
84872992533
-
A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
-
To appear in
-
Adams, W.P. and H.D. Sherali. (2003). "A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems." To appear in Annals of Operations Research.
-
(2003)
Annals of Operations Research
-
-
Adams, W.P.1
Sherali, H.D.2
-
3
-
-
0000511675
-
Facets of the knapsack polytope from minimal covers
-
Balas, E. and E. Zemel. (1978). "Facets of the Knapsack Polytope from Minimal Covers." SIAM Journal of Applied Mathematics 34, 119-148.
-
(1978)
SIAM Journal of Applied Mathematics
, vol.34
, pp. 119-148
-
-
Balas, E.1
Zemel, E.2
-
4
-
-
0020815626
-
Solving large-scale zero-one linear programming problems
-
Crowder, H., E.L. Johnson, and M. Padberg. (1983). "Solving Large-Scale Zero-One Linear Programming Problems." Operations Research 31, 803-834.
-
(1983)
Operations Research
, vol.31
, pp. 803-834
-
-
Crowder, H.1
Johnson, E.L.2
Padberg, M.3
-
5
-
-
0025209674
-
Coefficient reduction for knapsack constraints in 0-1 programs with VUBs
-
Dietrich, B.L. and L.F. Escudero. (1990). "Coefficient Reduction for Knapsack Constraints in 0-1 Programs with VUBs." Operation Research Letters 9, 9-14.
-
(1990)
Operation Research Letters
, vol.9
, pp. 9-14
-
-
Dietrich, B.L.1
Escudero, L.F.2
-
6
-
-
84911777897
-
Coefficient reduction with cover inequalities
-
IBM Research, T.J. Watson Research Center, Yorktown Heights, NY
-
Dietrich, B.L. and L.F. Escudero. (1989a). "Coefficient Reduction with Cover Inequalities." RC 14913, IBM Research, T.J. Watson Research Center, Yorktown Heights, NY.
-
(1989)
RC 14913
-
-
Dietrich, B.L.1
Escudero, L.F.2
-
7
-
-
84911777896
-
On extended coefficient reduction for 0-1 programs
-
IBM Research, T.J. Watson Research Center, Yorktown Heights, NY
-
Dietrich, B.L. and L.F. Escudero. (1989b). "On Extended Coefficient Reduction for 0-1 Programs." RC 15013, IBM Research, T.J. Watson Research Center, Yorktown Heights, NY.
-
(1989)
RC 15013
-
-
Dietrich, B.L.1
Escudero, L.F.2
-
9
-
-
43949170789
-
Efficient reformulations for 0-1 programs - Methods and computational results
-
Dietrich, B.L., L.F. Escudero, and F. Chance. (1993). "Efficient Reformulations for 0-1 Programs - Methods and Computational Results." Discrete Applied Mathematics 42, 147-175.
-
(1993)
Discrete Applied Mathematics
, vol.42
, pp. 147-175
-
-
Dietrich, B.L.1
Escudero, L.F.2
Chance, F.3
-
10
-
-
84948982049
-
A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
-
Copenhagen, Denmark
-
Escudero, L.F., S. Martello, and P. Toth. (1995). "A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems." In Proceedings of the 4th International Integer Programming and Combinatorial Optimization Conference, Copenhagen, Denmark, pp. 110-123.
-
(1995)
Proceedings of the 4th International Integer Programming and Combinatorial Optimization Conference
, pp. 110-123
-
-
Escudero, L.F.1
Martello, S.2
Toth, P.3
-
11
-
-
0032367433
-
On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
-
Escudero, L.F., S. Martello, and P. Toth. (1998). "On Tightening 0-1 Programs Based on Extensions of Pure 0-1 Knapsack and Subset-Sum Problems." Annals of Operations Research 81, 379-404.
-
(1998)
Annals of Operations Research
, vol.81
, pp. 379-404
-
-
Escudero, L.F.1
Martello, S.2
Toth, P.3
-
13
-
-
0016619730
-
Improved linear integer programming formulations of nonlinear integer programs
-
Glover, F. (1975). "Improved Linear Integer Programming Formulations of Nonlinear Integer Programs." Management Science 22, 455-460.
-
(1975)
Management Science
, vol.22
, pp. 455-460
-
-
Glover, F.1
-
14
-
-
0037566336
-
Foundation-penalty cuts for mixed-integer programs
-
Glover, F. and H.D. Sherali. (2003). "Foundation-Penalty Cuts for Mixed-Integer Programs." Operations Research Letters 31, 245-253.
-
(2003)
Operations Research Letters
, vol.31
, pp. 245-253
-
-
Glover, F.1
Sherali, H.D.2
-
15
-
-
0026125207
-
Improving 1p-representations of zero-one linear programs for branch-and-cut
-
Huffman, K.L. and M. Padberg. (1991). "Improving 1p-Representations of Zero-One Linear Programs for Branch-and-Cut." ORSA Journal on Computing 3, 121-134.
-
(1991)
ORSA Journal on Computing
, vol.3
, pp. 121-134
-
-
Huffman, K.L.1
Padberg, M.2
-
16
-
-
0022101121
-
Solving 0-1 integer programming problems arising from large scale planning models
-
Johnson, E.L., M.M. Kostreva, and U.K. Suhl. (1985). "Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models." Operations Research 33, 803-819.
-
(1985)
Operations Research
, vol.33
, pp. 803-819
-
-
Johnson, E.L.1
Kostreva, M.M.2
Suhl, U.K.3
-
17
-
-
0034999705
-
A note on coefficient adjustment using SOS constraints
-
Lougee-Heimer, R. (2001). "A Note on Coefficient Adjustment using SOS Constraints." Operations Research 48, 175-177.
-
(2001)
Operations Research
, vol.48
, pp. 175-177
-
-
Lougee-Heimer, R.1
-
19
-
-
84873006435
-
Exact and approximate algorithms for the two-constraint zero-one knapsack problem
-
Martello, S. and P. Toth. (1995). "Exact and Approximate Algorithms for the Two-Constraint Zero-One Knapsack Problem." Presented at EURO XIV, Jerusalem.
-
(1995)
EURO XIV, Jerusalem
-
-
Martello, S.1
Toth, P.2
-
20
-
-
0000278641
-
Preprocessing and probing techniques for mixed integer programming problems
-
Savelsbergh, M.W.P. (1994). "Preprocessing and Probing Techniques for Mixed Integer Programming Problems." ORSA Journal on Computing 6, 445-454.
-
(1994)
ORSA Journal on Computing
, vol.6
, pp. 445-454
-
-
Savelsbergh, M.W.P.1
-
21
-
-
0001321687
-
A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems
-
Sherali, H.D. and W.P. Adams. (1990). "A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems." SIAM Journal on Discrete Mathematics 3, 411-430.
-
(1990)
SIAM Journal on Discrete Mathematics
, vol.3
, pp. 411-430
-
-
Sherali, H.D.1
Adams, W.P.2
-
22
-
-
0002500749
-
A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems
-
manuscript 1989
-
Sherali, H.D. and W.P. Adams. (1994). "A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-Integer Zero-One Programming Problems." Discrete Applied Mathematics 52, 83-106, (manuscript 1989).
-
(1994)
Discrete Applied Mathematics
, vol.52
, pp. 83-106
-
-
Sherali, H.D.1
Adams, W.P.2
-
24
-
-
0000571594
-
Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems
-
Sherali, H.D., W.P. Adams, and P.J. Driscoll. (1998). "Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems." Operations Research 46, 396-405.
-
(1998)
Operations Research
, vol.46
, pp. 396-405
-
-
Sherali, H.D.1
Adams, W.P.2
Driscoll, P.J.3
-
25
-
-
0036656916
-
On tightening the relaxations of miller-tucker-zemlin formulations for the asymmetric traveling salesman problem
-
Sherali, H.D. and P.J. Driscoll. (2002). "On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for the Asymmetric Traveling Salesman Problem." Operations Research 50(4), 656-669.
-
(2002)
Operations Research
, vol.50
, Issue.4
, pp. 656-669
-
-
Sherali, H.D.1
Driscoll, P.J.2
-
26
-
-
0000662646
-
A class of facet producing graphs for the vertex packing polyhedra
-
Trotter, L.E. (1975). "A Class of Facet Producing Graphs for the Vertex Packing Polyhedra." Discrete Mathematics 12, 373-388.
-
(1975)
Discrete Mathematics
, vol.12
, pp. 373-388
-
-
Trotter, L.E.1
|