A linearization method for mixed 0--1 polynomial programs
From MaRDI portal
Publication:1577382
DOI10.1016/S0305-0548(99)00071-4zbMath0970.90055OpenAlexW2034901143MaRDI QIDQ1577382
Chi-Chiao Chang, Ching-Ter Chang
Publication date: 11 January 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00071-4
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Boolean programming (90C09)
Related Items (17)
A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization ⋮ Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes ⋮ A linearized value-at-risk model with transaction costs and short selling ⋮ A unified model for Weber problems with continuous and network distances ⋮ A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization ⋮ An efficient linearization technique for mixed 0-1 polynomial problem ⋮ Health service network design: a robust possibilistic approach ⋮ Mixed integer programming for the 0--1 maximum probability model. ⋮ Linear forms of nonlinear expressions: new insights on old ideas ⋮ Weber problems with mixed distances and regional demand ⋮ Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network ⋮ 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 ⋮ An alternative efficient representation for the project portfolio selection problem ⋮ A fuzzy-budgeted robust optimization model for joint network design-pricing problem in a forward-reverse supply chain: the viewpoint of third-party logistics ⋮ Optimization approach for data allocation in multidisk database ⋮ ``Miniaturized linearizations for quadratic 0/1 problems
Uses Software
Cites Work
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- An approximate method for local optima for nonlinear mixed integer programming problems
- An approximate approach of global optimization for polynomial programming problems
- Solving zero-one mixed integer programming problems using tabu search
- Computational study of a family of mixed-integer quadratic programming problems
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
This page was built for publication: A linearization method for mixed 0--1 polynomial programs
