The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
From MaRDI portal
(Redirected from Publication:378090)
Recommendations
- A polyhedral study of the semi-continuous knapsack problem
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
- New valid inequalities for the fixed-charge and single-node flow polytopes
- Integer Programming and Combinatorial Optimization
- Nonconvex, lower semicontinuous piecewise linear optimization
Cites work
- scientific article; zbMATH DE number 3908168 (Why is no real title available?)
- scientific article; zbMATH DE number 3666722 (Why is no real title available?)
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- A Discrete Optimization Approach to Large Scale Supply Networks Based on Partial Differential Equations
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- A family of inequalities for the generalized assignment polytope
- 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 Bound Methods for Mathematical Programming Systems
- 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
- Homotopies for computation of fixed points
- Integer Programming and Combinatorial Optimization
- Integer and mixed-integer programming models: General properties
- Large-Scale Portfolio Optimization
- Mixed integer minimization models for piecewise-linear functions of a single variable
- 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
- Nonconvex, lower semicontinuous piecewise linear optimization
- Nonlinear Programming
- Numerical Optimization
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- On the Solution of Discrete Programming Problems
- On triangulations for computing fixed points
- Piecewise linear approximation of functions of two variables in MILP models
- Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
- Simulation of hybrid circuits in constraint logic programming
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving nonlinear resistive networks using piecewise-linear analysis and simplicial subdivision
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
Cited in
(7)- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
- Valid inequalities for concave piecewise linear regression
- Mixed integer linear programming formulation techniques
- Structural investigation of piecewise linearized network flow problems
- Nonconvex, lower semicontinuous piecewise linear optimization
- Branch-and-cut for complementarity-constrained optimization
- A polyhedral study of the semi-continuous knapsack problem
This page was built for publication: The piecewise linear optimization polytope: new inequalities 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 Q378090)
