Narrow search
Showing 1 - 10 of 136
Cover Image
On approximation of the fixed charge transportation problem
Adlakha, Veena G.; Kowalski, Krzysztof; Wang, Simi; … - In: Omega : the international journal of management science 43 (2014), pp. 64-70
Persistent link: https://www.econbiz.de/10010238215
Cover Image
An exact algorithm for the fixed charge transportation problem based on matching source and sink patterns
Mingozzi, Aristide; Roberti, Roberto - In: Transportation science : a journal of the Institute for … 52 (2018) 2, pp. 229-238
Persistent link: https://www.econbiz.de/10011852809
Cover Image
The fixed charge transportation problem : an exact algorithm based on a new integer programming formulation
Roberti, Roberto; Bartolini, Enrico; Mingozzi, Aristide - In: Management science : journal of the Institute for … 61 (2015) 6, pp. 1275-1291
Persistent link: https://www.econbiz.de/10011293392
Cover Image
Fixed charge multicommodity network design using p-partition facets
Agarwal, Y. K.; Aneja, Yash P. - In: European journal of operational research : EJOR 258 (2017) 1, pp. 124-135
Persistent link: https://www.econbiz.de/10011641472
Cover Image
Improved branching disjunctions for branch-and-bound : an analytic center approach
Elhedi, Samir; Naoum-Sawaya, Joe - In: European journal of operational research : EJOR 247 (2015) 1, pp. 37-45
Persistent link: https://www.econbiz.de/10011347135
Cover Image
A branch-and-bound algorithm for the coupled task problem
Békési, József; Galambos, Gábor; Jung, Michael N.; … - In: Mathematical methods of operations research 80 (2014) 1, pp. 47-81
Persistent link: https://www.econbiz.de/10010406749
Cover Image
A branch-and-bound algorithm for the acyclic partitioning problem
Nossack, Jenny; Pesch, Erwin - In: Computers & operations research : and their … 41 (2014), pp. 174-184
Persistent link: https://www.econbiz.de/10010222694
Cover Image
A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof - In: European journal of operational research : EJOR 298 (2022) 1, pp. 89-98
Persistent link: https://www.econbiz.de/10013206812
Cover Image
A branch-and-bound method for the bi-objective simple line assembly balancing problem
Cerqueus, Audrey; Delorme, Xavier - In: International journal of production research 57 (2019) 18, pp. 5640-5659
Persistent link: https://www.econbiz.de/10012193644
Cover Image
Reducing the 0-1 knapsack problem with a single continuous variable to the standard 0-1 knapsack problem
Büther, Marcel; Briskorn, Dirk - 2007
The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable. This variable might be unbounded or restricted by a lower or...
Persistent link: https://www.econbiz.de/10011558835