Search Results - subject:"Set partitioning"

Baldi, Mauro Maria; Crainic, Teodor Gabriel; Perboli, Guido - In: Transportation research / E : an international journal 48 (2012) 6, pp. 1205-1220

Persistent link: https://www.econbiz.de/10009623004

A hybrid heuristic for the set covering problem

Sundar, Shyam; Singh, Alok - In: Operational research : an international journal 12 (2012) 3, pp. 345-365

Persistent link: https://www.econbiz.de/10009631483

The bin packing problem with precedence constraints

Dell'Amico, Mauro; Díaz Díaz, José Carlos; Iori, Manuel - In: Operations research 60 (2012) 6, pp. 1491-1504

Persistent link: https://www.econbiz.de/10009701914

Development of a stochastic optimisation tool for solving the multiple container packing problems

Thapatsuwan, Peeraya; Pongcharoen, Pupong; Hicks, Chris; … - In: International journal of production economics 140 (2012) 2, pp. 737-748

Persistent link: https://www.econbiz.de/10009682543

An exact algorithm for the three-dimensional loading capacitated vehicle routing problem

Ren, Jidong; Tian, Yajie; Sawaragi, Tetsuo - In: International journal of business performance and … 4 (2012) 3/4, pp. 317-332

Persistent link: https://www.econbiz.de/10009692924

On the fractionality of the path packing problem

Vanetik, Natalia - In: Journal of combinatorial optimization 24 (2012) 4, pp. 526-539

Persistent link: https://www.econbiz.de/10009664548

MIP-based approaches for the container loading problem with multi-drop constraints

Lustosa, Leonardo Junqueira; Morabito, Reinaldo; Sato … - 2012

Persistent link: https://www.econbiz.de/10009671404

Solving an one-dimensional cutting stock problem by simulated annealing and tabu search

Jahromi, Meghdad HMA; Tavakkoli-Moghaddam, Reza; Makui, … - In: Journal of industrial engineering international 8 (2012), pp. 1-8

A cutting stock problem is one of the main and classical problems in operations research that is modeled as LP problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms,...

Persistent link: https://www.econbiz.de/10009758828

A simple approach to the two-dimensional guillotine cutting stock problem

Aryanezhad, Mir-Bahador; Hashemi, Nima Fakhim; Makui, Ahmad - In: Journal of industrial engineering international 8 (2012), pp. 1-10

Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a...

Persistent link: https://www.econbiz.de/10009758832

Comparing online algorithms for bin packing problems

Epstein, Leah; Favrholdt, Lene M.; Kohrt, Jens S. - In: Journal of scheduling 15 (2012) 1, pp. 13-21

Persistent link: https://www.econbiz.de/10009522884