Branch-and-cut for complementarity-constrained optimization (Q482112): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s12532-014-0070-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035640668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / 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: Technical Note—The Use of Cuts in Complementary Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Significance of Solving Linear Programming Problems with Some Integer Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Complementarity Knapsack Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nurse scheduling with tabu search and strategic oscillation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE MULTIPLE-CHOICE KNAPSACK PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-Planes for Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer and mixed-integer programming models: General properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer minimization models for piecewise-linear functions of a single variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexification Techniques for Linear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4649020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints / rank
 
Normal rank

Latest revision as of 12:02, 9 July 2024

scientific article
Language Label Description Also known as
English
Branch-and-cut for complementarity-constrained optimization
scientific article

    Statements

    Branch-and-cut for complementarity-constrained optimization (English)
    0 references
    0 references
    0 references
    19 December 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    complementarity
    0 references
    multiple-choice
    0 references
    special ordered set
    0 references
    mixed-integer programming
    0 references
    knapsack set
    0 references
    polyhedral method
    0 references
    branch-and-cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references