Description of 2-integer continuous knapsack polyhedra

Authors:
A. Agra;M. Constantino
Affiliations:
Department of Mathematics and CEOC, University of Aveiro, Campus Universitário de Santiago, 3810-193 Aveiro, Portugal;DEIO and CIO, University of Lisbon, Edifício C6, Campo Grande, 1749-016 Lisboa, Portugal
Venue:
Discrete Optimization
Year:
2006

Citing 6
Cited 1

Hilbert bases and the facets of special knapsack polytopes

Mathematics of Operations Research
On the dimension of projected polyhedra

Discrete Applied Mathematics
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables

Journal of the ACM (JACM)
A Polynomial Algorithm for the Two-Variable Integer Programming Problem

Journal of the ACM (JACM)
Aggregation and Mixed Integer Rounding to Solve MIPs

Operations Research
Designing capacitated survivable networks: polyhedral analysis and algorithms

Designing capacitated survivable networks: polyhedral analysis and algorithms

Mixed Integer Formulations for a Short Sea Fuel Oil Distribution Problem

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss the polyhedral structure of several mixed integer sets involving two integer variables. We show that the number of the corresponding facet-defining inequalities is polynomial on the size of the input data and their coefficients can also be computed in polynomial time using a known algorithm [D. Hirschberg, C. Wong, A polynomial-time algorithm for the knapsack problem with two variables, Journal of the Association for Computing Machinery 23 (1) (1976) 147-154] for the two integer knapsack problem. These mixed integer sets may arise as substructures of more complex mixed integer sets that model the feasible solutions of real application problems. al application problems.