An efficient linearization approach for mixed-integer problems
From MaRDI portal
Publication:1572989
DOI10.1016/S0377-2217(99)00106-XzbMath0982.90034OpenAlexW2050130693MaRDI QIDQ1572989
Publication date: 11 April 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00106-x
Related Items (23)
A weighting method for 0-1 indefinite quadratic bilevel programming ⋮ Revised multi-choice goal programming ⋮ A seasonal demand inventory model with variable lead time and resource constraints ⋮ On the single item multi-supplier system with variable lead-time, price-quantity discount, and resource constraints ⋮ Binary fuzzy goal programming ⋮ Solving multi-period interdiction via generalized Bender's decomposition ⋮ Time–cost trade-off in a multi-choice assignment problem ⋮ Mixed integer programming for the 0--1 maximum probability model. ⋮ Linear forms of nonlinear expressions: new insights on old ideas ⋮ A goal programming approach for fuzzy multiobjective fractional programming problems ⋮ On the inventory model with continuous and discrete lead time, backorders and lost sales ⋮ On the polynomial mixed 0-1 fractional programming problems ⋮ An integrated JIT--PQD model for enhancing buyer--supplier linkage (revised version) ⋮ Reformulation of the modified goal programming for logarithmic piecewise linear function ⋮ On the mixed binary goal programming problems ⋮ Formulating the mixed integer fractional posynomial programming ⋮ An acquisition policy for a single item multi-supplier system with real-world constraints ⋮ Linearization of a 0-1 quadratic fractional programming problem ⋮ Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem ⋮ Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem ⋮ Fractional programming with absolute-value functions: a fuzzy goal programming approach ⋮ On the mixed integer signomial programming problems ⋮ On the posynomial fractional programming problems
Uses Software
Cites Work
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- An approximate approach of global optimization for polynomial programming problems
- Solving zero-one mixed integer programming problems using tabu search
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- An Improved MIP Formulation for Products of Discrete and Continuous Variables
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
This page was built for publication: An efficient linearization approach for mixed-integer problems
