Relaxation heuristics for the set multicover problem with generalized upper bound constraints
Year of publication: |
May 2018
|
---|---|
Authors: | Umetani, Shunji ; Arakawa, Masanao ; Yagiura, Mutsunori |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 93.2018, p. 90-100
|
Subject: | combinatorial optimization | set covering problem | metaheuristics | local search | Lagrangian relaxation | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Tourenplanung | Vehicle routing problem | Scheduling-Verfahren | Scheduling problem |
-
Umetani, Shunji, (2017)
-
Upper and lower bounding procedures for the multiple knapsack assignment problem
Kataoka, Seiji, (2014)
-
Nishi, Tatsushi, (2017)
- 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 ...