Locally ideal formulations for piecewise linear functions with indicator variables
From MaRDI portal
Publication:2450745
DOI10.1016/j.orl.2013.08.010zbMath1287.90039OpenAlexW2151682930MaRDI QIDQ2450745
Srikrishna Sridhar, Jeff Linderoth, James R. Luedtke
Publication date: 15 May 2014
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://digital.library.wisc.edu/1793/65192
Related Items
An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem, Piecewise polyhedral formulations for a multilinear term, A scalable anticipatory policy for the dynamic pickup and delivery problem, On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization, Structural Investigation of Piecewise Linearized Network Flow Problems, On Mixed-Integer Programming Formulations for the Unit Commitment Problem, Models and solution techniques for production planning problems with increasing byproducts, An effective logarithmic formulation for piecewise linearization requiring no inequality constraint, Set characterizations and convex extensions for geometric convex-hull proofs, Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
Cites Work
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Location, scheduling, design and integer programming
- Models for representing piecewise linear cost functions
- Approximating separable nonlinear functions via mixed zero-one programs
- Integer and mixed-integer programming models: General properties
- Mixed integer models for the stationary case of gas network optimization
- Mixed Integer Linear Programming Formulation Techniques
- Perspective Reformulation and Applications
- Using Piecewise Linear Functions for Solving MINLPs
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Modelling with integer variables
- On the Solution of Discrete Programming Problems
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- A composite algorithm for a concave-cost network flow problem
- Integer Programming Models for Sales Resource Allocation
- Disjunctive Programming
- Polyhedral methods for piecewise-linear functions. I: The lambda method
