Toward unification of exact and heuristic optimization methods
From MaRDI portal
Publication:5246819
DOI10.1111/itor.12020zbMath1309.90087OpenAlexW2021280019MaRDI QIDQ5246819
Publication date: 22 April 2015
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12020
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Integrated methods for optimization
- A survey of very large-scale neighborhood search techniques
- Integrated methods for optimization.
- Partitioning procedures for solving mixed-variables programming problems
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- Logic-based Benders decomposition
- Greedy randomized adaptive search procedures
- Exploiting relaxation in local search for LABS
- Conflict analysis in mixed integer programming
- Constraint Programming and Local Search Hybrids
- Hybrid Metaheuristics
- An Integrated Solver for Optimization Problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Improving the Held and Karp Approach with Constraint Programming
- Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
- Constraint-Based Local Search for Constrained Optimum Paths Problems
- Tabu Search—Part I
- Experiments in mixed-integer linear programming using pseudo-costs
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Experiments in mixed-integer linear programming
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
