A new global approach for \(0\)-\(1\) polynomial programs
From MaRDI portal
Publication:1317077
DOI10.1016/0305-0548(94)90093-0zbMath0792.90047OpenAlexW1566134127MaRDI QIDQ1317077
Publication date: 18 April 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90093-0
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An implicit branch-and-bound algorithm for mixed-integer linear programming
- Tabu search for large scale timetabling problems
- An approximate method for local optima for nonlinear mixed integer programming problems
- On implementation of computational algorithms for optimal design 2: Extensive numerical investigation
- Note—An Improved Discrete Dynamic Programming Algorithm for Allocating Resources Among Interdependent Projects
- Tabu Search—Part I
- Tabu Search Applied to the Quadratic Assignment Problem
- 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
