Pages that link to "Item:Q5900309"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2004 (Q5900309):
Displayed 13 items.
- Weighted heuristic anytime search: new schemes for optimization over graphical models (Q513336) (← links)
- The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem (Q932211) (← links)
- Combining two pheromone structures for solving the car sequencing problem with ant colony optimization (Q932221) (← links)
- Random partial neighborhood search for the post-enrollment course timetabling problem (Q1652508) (← links)
- PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) (← links)
- Computing solutions of the paintshop-necklace problem (Q1761213) (← links)
- Variable neighborhood search for graphical model energy minimization (Q2287189) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Multi-language evaluation of exact solvers in graphical model discrete optimization (Q2398440) (← links)
- VNS approach for solving a financial portfolio design problem (Q2631242) (← links)
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions (Q6056893) (← links)
- Virtual pairwise consistency in cost function networks (Q6080987) (← links)
- Partial neighborhood local searches (Q6082175) (← links)