Tutorial on surrogate constraint approaches for optimization in graphs
From MaRDI portal
Publication:1402517
DOI10.1023/A:1023721723676zbMath1035.90096MaRDI 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
covering; independent sets; coloring; maximum cliques; surrogate constraints; mathematical relaxations
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, The case for strategic oscillation, On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints, 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, Simple and fast surrogate constraint heuristics for the maximum independent set problem, Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints, On generalized surrogate duality in mixed-integer nonlinear programming, A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem, Zero duality gap in surrogate constraint optimization: a concise review of models, Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems, A systematic study on meta-heuristic approaches for solving the graph coloring problem
Uses Software
