Solving 0-1 programming problems by a penalty approach.

DOI10.1007/BF03398524zbMath1141.90488OpenAlexW2775647880MaRDI QIDQ2468556

Louis Caccetta, Kok Lay Teo, H. W. Joseph Lee, Songgui Wang

Publication date: 25 January 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398524

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items

Manifold relaxations for integer programming

Uses Software

• CFSQP

Cites Work

• Integer linear programming formulation for a vehicle routing problem
• Introduction to global optimization
• Gomory cuts revisited
• On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
• Outline of an algorithm for integer solutions to linear programs
• An Automatic Method of Solving Discrete Programming Problems
• Stochastic global optimization methods part I: Clustering methods
• A shortest path algorithm for a nonrotating object among obstacles of arbitrary shapes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item