Principles and Practice of Constraint Programming – CP 2004
From MaRDI portal
Publication:5900309
DOI10.1007/b100482zbMath1152.68568OpenAlexW1508891358MaRDI QIDQ5900309
Gilles Trombettoni, Fred Glover, Bertrand Neveu
Publication date: 9 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100482
Related Items (13)
VNS approach for solving a financial portfolio design problem ⋮ Random partial neighborhood search for the post-enrollment course timetabling problem ⋮ Multi-language evaluation of exact solvers in graphical model discrete optimization ⋮ Initialization of metaheuristics: comprehensive review, critical analysis, and research directions ⋮ Virtual pairwise consistency in cost function networks ⋮ Partial neighborhood local searches ⋮ The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem ⋮ Combining two pheromone structures for solving the car sequencing problem with ant colony optimization ⋮ Weighted heuristic anytime search: new schemes for optimization over graphical models ⋮ PUSH: A generalized operator for the maximum vertex weight clique problem ⋮ Computing solutions of the paintshop-necklace problem ⋮ Variable neighborhood search for graphical model energy minimization ⋮ Iterative and core-guided maxsat solving: a survey and assessment
Uses Software
This page was built for publication: Principles and Practice of Constraint Programming – CP 2004
