Result 1 to 20 of 22 total
Hybrid heuristics for multimodal homecare scheduling. (English)
Beldiceanu, Nicolas (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28‒June 1, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29827-1/pbk). Lecture Notes in Computer Science 7298, 339-355 (2012).
1
Hybrid metaheuristics in combinatorial optimization: A survey. (English)
Appl. Soft. Comput. 11, No. 6, 4135-4151 (2011).
2
Dantzig-Wolfe decomposition and branch-and-price solving in G12. (English)
Constraints 16, No. 1, 77-99 (2011).
3
Hybrid metaheuristics. (English)
Milano, Michela (ed.) et al., Hybrid optimization. The ten years of CPAIOR. New York, NY: Springer (ISBN 978-1-4419-1643-3/hbk; 978-1-4419-1644-0/ebook). Springer Optimization and Its Applications 45, 305-335 (2011).
4
The multidimensional knapsack problem: structure and algorithms. (English)
INFORMS J. Comput. 22, No. 2, 250-265 (2010).
5
Metaboosting: enhancing integer programming techniques by metaheuristics (English)
Matheuristics, 71-102 (2010).
6
A Lagrangian decomposition/evolutionary algorithm hybrid for the knapsack constrained maximum spanning tree problem. (English)
Cotta, Carlos (ed.) et al., Recent advances in evolutionary computation for combinatorial optimization. Most papers are extended versions of selected papers from the 7th conference on evolutionary computation and metaheuristics in combinatorial optimization (EvoCOP’2007), Valencia, Spain, April 11‒13, 2007. Berlin: Springer (ISBN 978-3-540-70806-3/hbk). Studies in Computational Intelligence 153, 69-85 (2008).
7
Bringing order into the neighborhoods: Relaxation guided variable neighborhood search. (English)
J. Heuristics 14, No. 5, 457-472 (2008).
8
From high-level model to branch-and-price solution in G12. (English)
Perron, Laurent (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 5th international conference, CPAIOR 2008 Paris, France, May 20‒23, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68154-0/pbk). Lecture Notes in Computer Science 5015, 218-232 (2008).
9
Flexible, rule-based constraint model linearisation. (English)
Hudak, Paul (ed.) et al., Practical aspects of declarative languages. 10th international symposium, PADL 2008, San Francisco, CA, USA, January 7‒8, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-77441-9/pbk). Lecture Notes in Computer Science 4902, 68-83 (2008).
10
Combining (Integer) linear programming techniques and metaheuristics for combinatorial optimization (English)
Hybrid Metaheuristics, 31-62 (2008).
11
A Lagrangian decomposition/evolutionary algorithm hybrid for the knapsack constrained maximum spanning tree problem (English)
Recent Advances in Evolutionary Computation for Combinatorial Optimization, 69-85 (2008).
12
Flexible, rule-based constraint model linearisation (English)
PADL, 68-83 (2008).
13
Automating branch-and-bound for dynamic programs (English)
PEPM, 81-89 (2008).
14
The core concept for 0/1 integer programming (English)
CATS, 39-47 (2008).
15
From high-level model to branch-and-price solution in G12 (English)
CPAIOR, 218-232 (2008).
16
Combining Lagrangian decomposition with an evolutionary algorithm for the knapsack constrained maximum spanning tree problem (English)
EvoCOP, 176-187 (2007).
17
The core concept for the multidimensional knapsack problem (English)
EvoCOP, 195-208 (2006).
18
Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification (English)
IWINAC (2), 41-53 (2005).
19
Solving a real-world glass cutting problem. (English)
Gottlieb, Jens (ed.) et al., Evolutionary computation in combinatorial optimization. 4th European conference, EvoCOP 2004, Coimbra, Portugal, April 5‒7, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21367-8/pbk). Lecture Notes in Computer Science 3004, 165-176 (2004).
20
Result 1 to 20 of 22 total
Start
Contact
Print
General Help
