Search Results - subject:"programming formulation"

Efficiently routing a fleet of autonomous vehicles in a real-time ride-sharing system

Bruglieri, Maurizio; Peruzzini, R.; Pisacane, O. - In: Computers & operations research : an international journal 168 (2024), pp. 1-27

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

Mixed integer linear programming formulation for K-means clustering problem

Ágoston, Kolos Csaba; E.-Nagy, Marianna - In: Central European journal of operations research 32 (2024) 1, pp. 11-27

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

Valid inequalities for the non-unit demand capacitated minimum spanning tree problem with arc time windows and flow costs

Kritikos, Manolis N.; Ioannou, George - In: International journal of production research 62 (2024) 1/2, pp. 574-585

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

A note on valid inequalities for minimizing the total tardiness in a two-machine flow shop

Spindler, Sebastian; Soppert, Matthias; Steinhardt, Claudius - In: Journal of the Operational Research Society 74 (2023) 12, pp. 2573-2577

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

An efficient benders decomposition for the p-median problem

Duran-Mateluna, Cristian; Ales, Zacharie; Elloumi, Sourour - In: European journal of operational research : EJOR 308 (2023) 1, pp. 84-96

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

A scaleable projection‐based branch‐and‐cut algorithm for the p‐center problem

Gaar, Elisabeth; Sinnl, Markus - In: European journal of operational research : EJOR 303 (2022) 1, pp. 78-98

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

Mathematical models for a batch scheduling problem to minimize earliness and tardiness

Ogun, Basar; Alabas-Uslu, Çigdem - In: Journal of Industrial Engineering and Management (JIEM) 11 (2018) 3, pp. 390-405

Purpose: Today's manufacturing facilities are challenged by highly customized products and just in time manufacturing and delivery of these products. In this study, a batch scheduling problem has been addressed to enable on-time completion of customer orders in a lean manufacturing environment....

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

Mathematical models for a batch scheduling problem to minimize earliness and tardiness

Ogun, Basar; Alabas-Uslu, Çigdem - In: Journal of industrial engineering and management : JIEM 11 (2018) 3, pp. 390-405

Purpose: Today’s manufacturing facilities are challenged by highly customized products and just in time manufacturing and delivery of these products. In this study, a batch scheduling problem has been addressed to enable on-time completion of customer orders in a lean manufacturing...

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

Optimal allocating and sizing of passenger ferry fleet in maritime transport

Škurić, Maja; Maraš, Vladislav; Davidović, Tatjana; … - In: Research in transportation economics 90 (2021), pp. 1-16

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

Polynomial size IP formulations of knapsack may require exponentially large coefficients

Hojny, Christopher - In: Operations research letters 48 (2020) 5, pp. 612-618

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