An efficient linearization technique for mixed 0-1 polynomial problem

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Journal of Computational and Applied Mathematics

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.cam.2010.08.009
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions

  2009cited by this paper
• A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems

  2005cited by this paper
• A linearization method for mixed 0-1 polynomial programs

  2000cited by this paper
• A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

  1998cited by this paper
• A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems

  1994cited by this paper
• Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions

  1994cited by this paper
• A lift-and-project cutting plane algorithm for mixed 0–1 programs

  1993cited by this paper
• A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems

  1992cited by this paper
• A hierarchy of relaxation between the continuous and convex hull representations

  1990cited by this paper
• Solving Mixed Integer Programming Problems Using Automatic Reformulation

  1987cited by this paper
• Media Selection by Decision Programming

  1976cited by this paper
• IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS

  1975cited by this paper
• Letter to the Editor - Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems

  1967cited by this paper

• Multi-disruption resilient hub location–allocation network design for less-than-truckload logistics

  2024cites this paper
• Life cycle assessment and multi-objective optimization for industrial utility systems

  2023cites this paper
• Developing a new model for a competitive facility location problem considering sustainability using Markov chains

  2020cites this paper
• Integration of efficient multi-objective ant-colony and a heuristic method to solve a novel multi-objective mixed load school bus routing model

  2018cites this paper
• Joint dynamic switching point configuration and resource allocation in TDD‐OFDMA networks: optimal formulation and suboptimal solution

  2016cites this paper
• Designing integrated cellular manufacturing systems with tactical decisions

  2015cites this paper
• A Benders' Decomposition Method to Solve Stochastic Distribution Network Design Problem with Two Echelons and Inter-Depot Transportation

  2015cites this paper
• A joint uplink-downlink optimization framework for resource management in next generation wireless networks -

  2014influential citation
• Optimization and Mathematical Programming to Design and Planning Issues in Cellular Manufacturing Systems under Uncertain Situations

  2012cites this paper
• Integrating Strategic and Tactical Decisions to Robust Designing of Cellular Manufacturing under Uncertainty: Fixed Suppliers in Supply Chain

  2011cites this paper
• An integrated multi−period planning of the production and transportation of multiple petroleum products in a single pipeline system

  2011cites this paper