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

Latest revision as of 09:38, 5 July 2024

scientific article

Language	Label	Description	Also known as
English	A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting	scientific article

Statements

instance of

scholarly article

0 references

title

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

0 references

zbMATH Open document ID

1241.90127

0 references

DOI

10.1016/j.disopt.2010.09.004

0 references

author

Jean-Philippe P. Richard

0 references

Bo Zeng

0 references

published in

Discrete Optimization

0 references

publication date

20 June 2012

0 references

Mathematics Subject Classification ID

0 references

0 references

knapsack

0 references

cardinality constraint

0 references

cutting plane

0 references

sequence-independent lifting

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disopt.2010.09.004

0 references

OpenAlex ID

W1973223260

0 references

cites work

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

0 references

Second-order cover inequalities

0 references

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

0 references

Valid Inequalities and Superadditivity for 0–1 Integer Programs

0 references

Sequence independent lifting in mixed integer programming

0 references

Sequence Independent Lifting for Mixed-Integer Programming

0 references

The 0-1 knapsack problem with a single continuous variable

0 references

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

0 references

On the facets of the mixed-integer knapsack polyhedron

0 references

Sequence independent lifting for mixed integer programs with variable upper bounds

0 references

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

0 references

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

0 references

A note on the knapsack problem with special ordered sets

0 references

A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:429687

@@ Property / author @@
-Bo Zeng
@@ Property / author: Bo Zeng / rank @@
-Normal rank
@@ Property / author @@
+Bo Zeng
@@ Property / author: Bo Zeng / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6048254
@@ Property / zbMATH DE Number: 6048254 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+knapsack
@@ Property / zbMATH Keywords: knapsack / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+cardinality constraint
@@ Property / zbMATH Keywords: cardinality constraint / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+cutting plane
@@ Property / zbMATH Keywords: cutting plane / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+sequence-independent lifting
@@ Property / zbMATH Keywords: sequence-independent lifting / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2010.09.004
+Normal rank
@@ Property / OpenAlex ID @@
+W1973223260
@@ Property / OpenAlex ID: W1973223260 / rank @@
+Normal rank
@@ Property / cites work @@
+A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
+Normal rank
@@ Property / cites work @@
+Second-order cover inequalities
@@ Property / cites work: Second-order cover inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
+Normal rank
@@ Property / cites work @@
+Valid Inequalities and Superadditivity for 0–1 Integer Programs
+Normal rank
@@ Property / cites work @@
+Sequence independent lifting in mixed integer programming
+Normal rank
@@ Property / cites work @@
+Sequence Independent Lifting for Mixed-Integer Programming
+Normal rank
@@ Property / cites work @@
+The 0-1 knapsack problem with a single continuous variable
+Normal rank
@@ Property / cites work @@
+Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
+Normal rank
@@ Property / cites work @@
+On the facets of the mixed-integer knapsack polyhedron
+Normal rank
@@ Property / cites work @@
+Sequence independent lifting for mixed integer programs with variable upper bounds
+Normal rank
@@ Property / cites work @@
+Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
+Normal rank
@@ Property / cites work @@
+Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
+Normal rank
@@ Property / cites work @@
+A note on the knapsack problem with special ordered sets
+Normal rank
@@ Property / cites work @@
+A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:429687