Similar Search Results

Finding compromise solutions in project portfolio selection with multiple experts by inverse optimization

Roland, Julien; Figueira, José Rui; De Smet, Yves - In: Computers & operations research : and their … 66 (2016), pp. 12-19

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

An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules

Jin, Bo; Tanaka, Shunji - In: European journal of operational research : EJOR 304 (2023) 2, pp. 494-514

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

A new branch-and-bound algorithm for the maximum edge-weighted clique problem

San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; … - In: European journal of operational research : EJOR 278 (2019) 1, pp. 76-90

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

Exact solution algorithms for the maximum flow problem with additional conflict constraints

Şuvak, Zeynep; Altınel, İ. Kuban; Aras, Necati - In: European journal of operational research : EJOR 287 (2020) 2, pp. 410-437

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

An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints

Pamuk, Bahadır; Öncan, Temel; Altınel, İ. Kuban - In: European journal of operational research : EJOR 324 (2025) 2, pp. 398-413

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

Absalom: Balancing assembly lines with assignment restrictions

Scholl, Armin; Fliedner, Malte; Boysen, Nils - Wirtschaftswissenschaftliche Fakultät, … - 2008

Assembly line balancing problems (ALBPs) arise whenever an assembly line is configured, redesigned or adjusted. An ALBP consists of distributing the total workload for manufacturing products among the work stations along the line. On the one hand, research has focussed on developing effective...

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