scientific article

zbMath0413.90047MaRDI QIDQ3048579

Manfred W. Padberg, Egon Balas

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveyinteger programmingpolytopesBibliographyset packingcutting planesset coveringcomputational experiencefacetsclique coveringhybrid methodimplicit enumerationset partitioningedge coveringsolution methodstheoreticalcomprehensive bibliographyresultsadjacency relationsnode coveringnode packingedge matchingcolumn-generation procedurenecessary and sufficient conditions for integer verticessymmetric subgradient method

Mathematics Subject Classification ID

Integer programming (90C10) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Polytopes and polyhedra (52Bxx)

Related Items

A surrogate heuristic for set covering problems, An optimization modeling for customer redistribution and its spreadsheet implementation, A new approach for crew pairing problems by column generation with an application to air transportation, Exact satisfiability, a natural extension of set partition, and its average case behavior, A heuristic with tie breaking for certain 0–1 integer programming models, A network relaxation based enumeration algorithm for set partitioning, Use of hidden network structure in the set partitioning problem, Membership functions, some mathematical programming models and production scheduling, Cores of partitioning games, A relax-and-cut algorithm for the set partitioning problem, A characterization of the uncapacitated network design polytope, Scheduling with neural networks -- the case of the Hubble Space Telescope, A continuous problem of optimal partition with a nondifferentiable functional, An algorithm for set covering problem