Search Results - subject:"Exact algorithms"

Tramp ship routing and scheduling with voyage separation requirements

Vilhelmsen, Charlotte; Lusby, Richard M.; Larsen, Jesper - In: OR spectrum : quantitative approaches in management 39 (2017) 4, pp. 913-943

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

Order picking problems under weight, fragility and category constraints

Chabot, Thomas; Lahyani, Rahma; Coelho, Leandro C.; … - In: International journal of production research 55 (2017) 21, pp. 6361-6379

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

New algorithms for maximum weight matching and a decomposition theorem

Huang, Chien-chung; Kavitha, Telikepalli - In: Mathematics of operations research 42 (2017) 2, pp. 411-426

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

Designing and constructing networks under uncertainty in the construction stage : definition and exact algorithmic approach

Álvarez-Miranda, Eduardo; Pereira, Jordi - In: Computers & operations research : and their … 81 (2017), pp. 178-191

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

Analysis of the Single-Vehicle Cyclic Inventory Routing Problem

AGHEZZAF, EL-HOUSSAINE; ZHONG, Y.; RAA, B.; MATTEO, M. - Faculteit Economie en Bedrijfskunde, Universiteit Gent - 2011

The single-vehicle cyclic inventory routing problem (SV-CIRP) consists of a repetitive distribution of a product from a single depot to a selected subset of customers. For each customer, selected for replenishments, the supplier collects a corresponding fixed reward. The objective is to...

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

Bin packing and cutting stock problems : mathematical models and exact algorithms

Delorme, Maxence; Iori, Manuel; Martello, Silvano - In: European journal of operational research : EJOR 255 (2016) 1, pp. 1-20

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

Optimal placement of multiple types of detectors under a small vessel attack threat to port security

Yan, Xihong; Nie, Xiaofeng - In: Transportation research / E : an international journal 93 (2016), pp. 71-94

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

A review on algorithms for maximum clique problems

Wu, Qinghua; Hao, Jin-Kao - In: European Journal of Operational Research 242 (2015) 3, pp. 693-709

The maximum clique problem (MCP) is to determine in a graph a clique (i.e., a complete subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other combinatorial problems and real-world applications. As one of the most studied NP-hard problems, many algorithms are...

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

A review on algorithms for maximum clique problems

Wu, Qinghua; Hao, Jin-Kao - In: European journal of operational research : EJOR 242 (2015) 3, pp. 693-709

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

The production routing problem : a review of formulations and solution algorithms

Adulyasak, Yossiri; Cordeau, Jean-François; Jans, Raf - In: Computers & operations research : and their … 55 (2015), pp. 141-152

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