An efficient linearization approach for mixed-integer problems
From MaRDI portal
Publication:1572989
Recommendations
- A mixed-integer linear programming problem which is efficiently solvable
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- An algorithm for multiparametric mixed-integer linear programming problems
- An algorithm for the solution of multiparametric mixed integer linear programming problems
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- Exact and fast algorithms for mixed-integer nonlinear programming
- scientific article; zbMATH DE number 4012317
Cites work
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- An approximate approach of global optimization for polynomial programming problems
- An Improved MIP Formulation for Products of Discrete and Continuous Variables
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Solving zero-one mixed integer programming problems using tabu search
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
Cited in
(34)- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Mixed integer programming for the 0--1 maximum probability model.
- On the posynomial fractional programming problems
- A solution framework for linear PDE-constrained mixed-integer problems
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- A weighting method for 0-1 indefinite quadratic bilevel programming
- Solving multi-period interdiction via generalized Bender's decomposition
- Linear forms of nonlinear expressions: new insights on old ideas
- Reformulation of the modified goal programming for logarithmic piecewise linear function
- Formulating the mixed integer fractional posynomial programming
- An acquisition policy for a single item multi-supplier system with real-world constraints
- Fractional programming with absolute-value functions: a fuzzy goal programming approach
- On the mixed integer signomial programming problems
- A seasonal demand inventory model with variable lead time and resource constraints
- scientific article; zbMATH DE number 3885661 (Why is no real title available?)
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
- A mixed-integer linear programming problem which is efficiently solvable
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- scientific article; zbMATH DE number 764459 (Why is no real title available?)
- A goal programming approach for fuzzy multiobjective fractional programming problems
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- An integrated JIT--PQD model for enhancing buyer--supplier linkage (revised version)
- scientific article; zbMATH DE number 2187395 (Why is no real title available?)
- Mixed settings for linear problems
- On the polynomial mixed 0-1 fractional programming problems
- Time–cost trade-off in a multi-choice assignment problem
- An efficient linearization technique for mixed 0-1 polynomial problem
- On the mixed binary goal programming problems
- Revised multi-choice goal programming
- On the single item multi-supplier system with variable lead-time, price-quantity discount, and resource constraints
- Binary fuzzy goal programming
- On the inventory model with continuous and discrete lead time, backorders and lost sales
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- Linearization of a 0-1 quadratic fractional programming problem
This page was built for publication: An efficient linearization approach for mixed-integer problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1572989)
