✦ LIBER ✦

Exponential irreducible neighborhoods for combinatorial optimization problems

✍ Scribed by Robert T. Firla; Bianca Spille; Robert Weismantel

Publisher: Springer
Year: 2002
Tongue: English
Weight: 168 KB
Volume: 56
Category: Article
ISSN: 0340-9422
DOI: 10.1007/s001860200198

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Metaheuristic algorithms for combinatori

Metaheuristic algorithms for combinatorial optimization problems

✍ Manuel Iori 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 41 KB

An exponential neighborhood for a one-ma

An exponential neighborhood for a one-machine batching problem

✍ Johann Hurink 📂 Article 📅 1999 🏛 Springer 🌐 German ⚖ 129 KB

On metaheuristic algorithms for combinat

On metaheuristic algorithms for combinatorial optimization problems

✍ Mutsunori Yagiura; Toshihide Ibaraki 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 2 views

Optimal experimental design for combinat

Optimal experimental design for combinatorial problems

✍ Selden B. Grary; Cosimo Spera 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 745 KB

We discuss two experimental designs and show how to use them to evaluate difficult empirical combinatorial problems. We restrict our analysis here to the knapsack problem but comment more generally on the use of computational testing to analyze the performances of algorithms.

An exponential (matching based) neighbor

An exponential (matching based) neighborhood for the vehicle routing problem

✍ Eric Angel; Evripidis Bampis; Fanny Pascual 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 339 KB

A new dominance procedure for combinator

A new dominance procedure for combinatorial optimization problems

✍ Matteo Fischetti; Paolo Toth 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 693 KB