Pages that link to "Item:Q2775776"

The following pages link to Branch-and-cut for combinatorial optimization problems without auxiliary binary variables (Q2775776):

Displaying 21 items.

• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints (Q378090) (← links)
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
• Integer-programming software systems (Q817202) (← links)
• A special ordered set approach for optimizing a discontinuous separable piecewise linear function (Q935235) (← links)
• Models for representing piecewise linear cost functions (Q1433660) (← links)
• Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
• Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
• Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201) (← links)
• Semi-continuous network flow problems (Q2248765) (← links)
• A family of inequalities valid for the robust single machine scheduling polyhedron (Q2270446) (← links)
• Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
• On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
• On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
• A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
• Mixed integer models for the stationary case of gas network optimization (Q2583142) (← links)
• Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
• A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
• A combined variable aggregation presolving technique for mixed integer programming (Q6564293) (← links)
• New classes of facets for complementarity knapsack problems (Q6585265) (← links)
• Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
• Relaxations and cutting planes for linear programs with complementarity constraints (Q6607018) (← links)