Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2015.03.003 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974903013 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2015.03.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974903013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards the real time solution of strike force asset allocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Knapsack Polytope From Minimal Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fenchel Cutting Planes for Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert Bases and the Facets of Special Knapsack Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Facet Generation Procedure for Solving 0/1 Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the knapsack problem with special ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted cover facets of the 0-1 knapsack polytope with GUB constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sequential Knapsack Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multiple Knapsack Problems by Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order cover inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence independent lifting in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Inequalities and Superadditivity for 0–1 Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facets of the mixed-integer knapsack polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation method for the multiple-choice multi-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem / rank
 
Normal rank

Latest revision as of 16:05, 15 July 2024

scientific article
Language Label Description Also known as
English
Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
scientific article

    Statements

    Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (English)
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    multi-dimensional multiple-choice knapsack problem
    0 references
    multiple-choice knapsack problem
    0 references
    valid inequalities
    0 references
    \(\alpha\)-cover inequalities
    0 references
    sequential and sequence-independent lifting
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references