Knapsack polytopes: a survey (Q827125)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Knapsack polytopes: a survey	scientific article

Statements

scholarly article

0 references

Knapsack polytopes: a survey (English)

0 references

0 references

Annals of Operations Research

0 references

publication date

6 January 2021

0 references

zbMATH Keywords

knapsack polytope

0 references

cover inequality

0 references

lifting

0 references

separation problem

0 references

complete linear description

0 references

independence systems

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10479-019-03380-2

0 references

Mixed Integer Programming: Analyzing 12 Years of Progress

0 references

0 references

Matroidal relaxations for 0-1 knapsack problems

0 references

Cyclic group and knapsack facets

0 references

On the facets of the mixed-integer knapsack polyhedron

0 references

Cover and pack inequalities for (mixed) integer programming

0 references

A computational study of exact knapsack separation for the generalized assignment problem

0 references

Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable

0 references

Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix

0 references

Facets of the knapsack polytope

0 references

On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)

0 references

Facets of the Knapsack Polytope From Minimal Covers

0 references

0 references

On separating cover inequalities for the multidimensional knapsack problem

0 references

Computational study of a family of mixed-integer quadratic programming problems

0 references

Approximate formulations for 0-1 knapsack sets

0 references

A pseudopolynomial network flow formulation for exact knapsack separation

0 references

Generating Fenchel Cutting Planes for Knapsack Polyhedra

0 references

Polyhedral results for the precedence-constrained knapsack problem

0 references

Fenchel Cutting Planes for Integer Programs

0 references

Transformation of integer programs to knapsack problems

0 references

Coefficient reduction for inequalities in 0–1 variables

0 references

0 references

Cutting planes for integer programs with general integer variables

0 references

0 references

Extended formulations in combinatorial optimization

0 references

On the Facial Structure of Independence System Polyhedra

0 references

Solving Large-Scale Zero-One Linear Programming Problems

0 references

Complete description of a class of knapsack polytopes.

0 references

Discrete-Variable Extremum Problems

0 references

A polyhedral study of the cardinality constrained knapsack problem

0 references

On tightening cover induced inequalities

0 references

Approximate counting by dynamic programming

0 references

Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes

0 references

Facets of the independent set polytope

0 references

Matroids and the greedy algorithm

0 references

On the existence of compact $\varepsilon$-approximated formulations for knapsack in the original space

0 references

0 references

Solving Multiple Knapsack Problems by Cutting Planes

0 references

On the exact separation of mixed integer knapsack cuts

0 references

A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems

0 references

0 references

Adjacency of the 0-1 knapsack problem

0 references

A characterization of threshold matroids

0 references

Revlex-initial 0/1-polytopes

0 references

Second-order cover inequalities

0 references

Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming

0 references

Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem

0 references

Facets of the knapsack polytope derived from disjoint and overlapping index configurations

0 references

(1,k)-configuration facets for the generalized assignment problem

0 references

The generalized assignment problem: Valid inequalities and facets

0 references

Lifted Cover Inequalities for 0-1 Integer Programs: Complexity

0 references

Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs

0 references

Sequence independent lifting in mixed integer programming

0 references

Convex hulls of superincreasing knapsacks and lexicographic orderings

0 references

Facet of regular 0–1 polytopes

0 references

The Role of Master Polytopes in the Unit Cube

0 references

Computing low-capacity 0–1 knapsack polytopes

0 references

The complexity of lifted inequalities for the knapsack problem

0 references

The vertices of the knapsack polytope

0 references

Merging valid inequalities over the multiple knapsack polyhedron

0 references

Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut

0 references

0 references

Polytopes associated with symmetry handling

0 references

Simple lifted cover inequalities and hard knapsack problems

0 references

A note on the knapsack problem with special ordered sets

0 references

Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem

0 references

Separation algorithms for 0-1 knapsack polytopes

0 references

0 references

The complexity of cover inequality separation

0 references

Combinatorial optimization. Theory and algorithms.

0 references

A generalization of antiwebs to independence systems and their canonical facets

0 references

A characterization of knapsacks with the max-flow--min-cut property

0 references

On facets of knapsack equality polytopes

0 references

On lifted cover inequalities: a new lifting procedure with unusual properties

0 references

0 references

Polyhedral properties for the intersection of two knapsacks

0 references

Cutting planes in integer and mixed integer programming

0 references

The 0-1 knapsack problem with a single continuous variable

0 references

Aggregation and Mixed Integer Rounding to Solve MIPs

0 references

The cutting stock problem and integer rounding

0 references

0 references

0 references

Polyhedral Characterization of Discrete Dynamic Programming

0 references

Lifted cover facets of the 0-1 knapsack polytope with GUB constraints

0 references

0 references

Technical Note—A Note on Zero-One Programming

0 references

(1,k)-configurations and facets for packing problems

0 references

The complexity of facets (and some facets of complexity)

0 references

The complexity of facets resolved

0 references

Lifting cover inequalities for the precedence-constrained knapsack problem

0 references

0 references

The Sequential Knapsack Polytope

0 references

Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation

0 references

A note on the extension complexity of the knapsack polytope

0 references

Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms

0 references

Lifted inequalities for 0-1 mixed integer programming: superlinear lifting

0 references

Valid inequalities for mixed 0-1 programs

0 references

On the facial structure of the set covering polytope

0 references

0 references

Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities

0 references

Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes

0 references

The worst case analysis of strong knapsack facets

0 references

The complementary class of generalized flow cover inequalities

0 references

0 references

A Polyhedral Study of the Mixed Integer Cut

0 references

Lifting valid inequalities for the precedence constrained knapsack problem

0 references

Approximate extended formulations

0 references

A cutting plane method for knapsack polytope

0 references

An implementation of exact knapsack separation

0 references

Hilbert Bases and the Facets of Special Knapsack Polytopes

0 references

On the \(0/1\) knapsack polytope

0 references

Faces for a linear inequality in 0–1 variables

0 references

Technical Note—Facets and Strong Valid Inequalities for Integer Programs

0 references

Valid Inequalities and Superadditivity for 0–1 Integer Programs

0 references

Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints

0 references

The Integer Knapsack Cover Polyhedron

0 references

Cutting planes for mixed-integer knapsack polyhedra

0 references

Lifting the facets of zero–one polytopes

0 references

Easily Computable Facets of the Knapsack Polytope

0 references

A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting

0 references

A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10479-019-03380-2

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:827125

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q827125&oldid=36642788"