Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints

DOI10.1007/S12532-012-0049-9MaRDI QIDQ1947201zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 12 April 2013

Published in Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12532-012-0049-9

zbMATH Keywords

90knapsack problembranch-and-cutmixed-integer programmingpiecewise linear optimizationpolyhedral methodspecial ordered setsemi-continuous variable

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
• Nonconvex, lower semicontinuous piecewise linear optimization
• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• Integer Programming and Combinatorial Optimization
• Maximin Problem and a Duality Theorem for Mixed‐Integer Quadratic Programming

Cites work

• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• A generalized assignment problem with special ordered sets: a polyhedral approach.
• A polyhedral study of the cardinality constrained knapsack problem
• A special ordered set approach for optimizing a discontinuous separable piecewise linear function
• Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
• Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
• Computational study of a family of mixed-integer quadratic programming problems
• Integer Programming and Combinatorial Optimization
• Large-Scale Portfolio Optimization
• Mixed integer models for the stationary case of gas network optimization
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Models for representing piecewise linear cost functions
• Numerical Optimization
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• On the Solution of Discrete Programming Problems
• Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
• Solving Large-Scale Zero-One Linear Programming Problems
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs

Cited in

(7)

• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
• Equivalence of two optimality conditions for polyhedral functions
• Mixed integer linear programming formulation techniques
• Nonconvex, lower semicontinuous piecewise linear optimization
• Branch-and-cut for complementarity-constrained optimization
• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints

Describes a project that uses

Uses Software

• Gurobi
• CPLEX
• AMPL

This page was built for publication: Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1947201)