Tutorial on surrogate constraint approaches for optimization in graphs
From MaRDI portal
Publication:1402517
DOI10.1023/A:1023721723676zbMath1035.90096OpenAlexW1818231618MaRDI QIDQ1402517
Publication date: 28 August 2003
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1023721723676
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming ⋮ A systematic study on meta-heuristic approaches for solving the graph coloring problem ⋮ A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem ⋮ On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ The case for strategic oscillation ⋮ Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search ⋮ Surrogate constraint normalization for the set covering problem ⋮ Active-constraint variable ordering for faster feasibility of mixed integer linear programs ⋮ Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints ⋮ Simple and fast surrogate constraint heuristics for the maximum independent set problem ⋮ Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems ⋮ On generalized surrogate duality in mixed-integer nonlinear programming
Uses Software
