Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Nemhauser, George I. / rank
Normal rank
 
Property / author
 
Property / author: Nemhauser, George I. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C11 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C26 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5909175 / rank
 
Normal rank
Property / zbMATH Keywords
 
mixed integer binary formulation
Property / zbMATH Keywords: mixed integer binary formulation / rank
 
Normal rank
Property / zbMATH Keywords
 
tightless properties
Property / zbMATH Keywords: tightless properties / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PORTA / rank
 
Normal rank
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/s10107-009-0295-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4379506771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A composite algorithm for a concave-cost network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convex hull of the union of certain polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection, lifting and extended formulation integer and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Rules for Deducing Valid Inequalities for 0-1 Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation for multiple right-hand sides / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise linear interpolants to Lagrange and Hermite convex scattered data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsimonious binary-encoding in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems / 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: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut for combinatorial optimization problems without auxiliary binary variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulation of combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representability in mixed integer programming. I: Characterization results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplification for some disjunctive formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representability of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling with integer variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Results on the New Techniques for Integer Programming Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for representing piecewise linear cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-different polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Binary-Encoded ILP Coloring Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral methods for piecewise-linear functions. I: The lambda method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer models for the stationary case of gas network optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of optimal solutions to integer and mixed-integer programming problems / 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: A theoretical and computational comparison of “equivalent” mixed-integer formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating separable nonlinear functions via mixed zero-one programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems / 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: Nonconvex, lower semicontinuous piecewise linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:59, 4 July 2024

scientific article
Language Label Description Also known as
English
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
scientific article

    Statements

    Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (English)
    0 references
    0 references
    0 references
    17 June 2011
    0 references
    mixed integer binary formulation
    0 references
    tightless properties
    0 references
    0 references
    0 references

    Identifiers