Optimization Online


Facets of a polyhedron closely related to the integer knapsack-cover problem

David R. Mazur (dmazur***at***wnec.edu)
Leslie A. Hall (lah***at***jhu.edu)

Abstract: We investigate the polyhedral structure of an integer program with a single functional constraint: the integer capacity-cover polyhedron. Such constraints arise in telecommunications planning and facility location applications, and feature the use of general integer (rather than just binary) variables. We derive a large class of facet-defining inequalities by using an augmenting technique that builds upon the facets of a family of related knapsack-cover polyhedra. To the best of our knowledge, this technique is new, and in particular it differs from sequential or simultaneous lifting. It demonstrates an interesting theoretical connection between the facial structure of two families of polyhedra important in applications. Additionally, we derive another class of facet-defining inequalities via coefficient reduction.

Keywords: knapsack problems, polyhedral combinatorics, facility location

Category 1: Combinatorial Optimization (Polyhedra )

Category 2: Integer Programming ((Mixed) Integer Linear Programming )


Download: [Postscript][PDF]

Entry Submitted: 10/02/2002
Entry Accepted: 10/02/2002
Entry Last Modified: 10/02/2002

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society