Reformulating nonlinear combinatorial optimization problems for higher computational efficiency

DOI10.1016/0377-2217(92)90210-ZzbMath0766.90060OpenAlexW2036287410MaRDI QIDQ1194735

Muhittin Oral, Ossama Kettani

Publication date: 6 October 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90210-z

zbMATH Keywords

equivalent formulation

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items

Inductive linearization for binary quadratic programs with linear constraints ⋮ Two-stage quadratic integer programs with stochastic right-hand sides ⋮ Overcoming the Key Challenges in De Novo Protein Design: Enhancing Computational Efficiency and Incorporating True Backbone Flexibility ⋮ Compact linearization for binary quadratic problems subject to assignment constraints ⋮ A linearization framework for unconstrained quadratic (0-1) problems ⋮ Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem ⋮ Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design

Cites Work

• Unnamed Item
• Timetabling problem for university as assignment of activities to resources
• A methodology for multicriteria network partitioning
• A Layout Planning System with Multiple Criteria and a Variable Domain Representation
• Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
• Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
• An Integer Programming Procedure for Assembly System Design Problems
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
• On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
• A Balasian-Based Algorithm for Zero-One Polynomial Programming
• Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems