Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
Year of publication: |
16 November 2017
|
---|---|
Authors: | Umetani, Shunji |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 263.2017, 1 (16.11.), p. 72-81
|
Subject: | Combinatorial optimization | Heuristics | Set covering problem | Set partitioning problem | Local search | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Heuristik | Ganzzahlige Optimierung | Integer programming | Tourenplanung | Vehicle routing problem | Scheduling-Verfahren | Scheduling problem |
-
Nishi, Tatsushi, (2017)
-
Recursive circle packing problems
Pedroso, João Pedro, (2016)
-
Relaxation heuristics for the set multicover problem with generalized upper bound constraints
Umetani, Shunji, (2018)
- More ...
-
One-dimensional cutting stock problem to minimize the number of different patterns
Umetani, Shunji, (2003)
-
One-dimensional cutting stock problem to minimize the number of different patterns
Umetani, Shunji, (2003)
-
Relaxation Heuristics for the Set Covering Problem
Umetani, Shunji, (2007)
- More ...