Persistency in 0-1 polynomial programming

Mathematics of Operations Research

Volumn 23, Issue 2, 1998, Pages 359-389

  Adams, Warren P ^a   Lassiter, Julie Bowers ^a   Sherali, Hanif D ^b  

^a CLEMSON UNIVERSITY   (United States)

^b State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CONSTRAINT THEORY; FUNCTIONS; INTEGER PROGRAMMING; LINEARIZATION; OPTIMIZATION; POLYNOMIALS;

OPTIMAL DUAL MULTIPLIERS; PERSISTENCY; QUADRATIC OBJECTIVE FUNCTION COEFFICIENTS; VERTEX PACKING PROBLEM;

LINEAR PROGRAMMING;

EID: 0032070160     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.2.359     Document Type: Article

References (18)

1. Adams, W. P., A. Billionnet, A. Sutter (1990). Unconstrained 0-1 optimization and Lagrangean relaxation. Discrete Appl. Math. 29 131-142.
2. _, P. M. Dearing (1994). On the equivalence between roof duality and Lagrangian duality for unconstrained 0-1 quadratic programming problems. Discrete Appl. Math. 48 1-20.
3. Balas, E. (1981). Integer and fractional matchings. Ann. Discrete Math.: Studies on Graphs and Discrete Programming 11 1-13.
4. Balinski, M. L. (1965). Integer programming: methods, uses, computation. Management Sci. 12 253-313.
5. Billionnet, A., A. Sutter (1992). Persistency in quadratic 0-1 optimization. Math. Programming 54 115-119.
6. Bourjolly, J.-M. (1990). Stable sets, max-cuts and quadratic 0-1 optimization. Working Paper, Concordia University, January.
7. Hammer, P. L., P. Hansen, B. Simeone (1982). Vertices belonging to all or to no maximum stable sets of a graph. SIAM J. Alg. Disc. Meth. 3 511-522.
8. _, _, _ (1984). Roof duality, complementation and persistency in quadratic 0-1 optimization. Math. Programming 28 121-155.
9. Hochbaum, D. S. (1983). Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Appl. Math. 6 243-254.
10. _, N. Megiddo, J. Naor, A. Tamir (1993). Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Programming 62 69-83.
11. Lassiter, J. B. (1993). Persistency in 0-1 optimization. Ph.D. Dissertation, Clemson University.
12. Lu, S. H., B. Simeone (1987). On the equivalence of roof-duality and paved-duality in quadratic 0-1 optimization. RUTCOR Res. Rept. #22-87, Rutgers University, New Brunswick, NJ.
13. Nemhauser, G. L., L. E. Trotter, Jr. (1975). Vertex packings: structural properties and algorithms. Math. Programming 8 232-248.
14. Padberg, M. (1989). The boolean quadric polytope: some characteristics, facets, and relatives. Math. Programming 45 139-172.
15. Picard, J., M. Queyranne (1977). On the integer-valued variables in the linear vertex packing problem. Math. Programming 12 97-101.
16. Rhys, J. M. W. (1970). A selection problem of shared fixed costs and network flows. Management Sci. 17 200-207.
17. Sherali, H. D., W. P. Adams (1990). A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Disc. Math. 3 411-430.
18. Uhry, J. P. (1975). Sur le problème du couplage maximal. R.A.I.R.O. 9 V-3, 13-20.