Narrow search
Showing 1 - 4 of 4
Cover Image
Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
Gadegaard, Sune Lauth; Nielsen, Lars Relund; Ehrgott, … - In: INFORMS journal on computing : JOC 31 (2019) 4, pp. 790-804
Persistent link: https://www.econbiz.de/10012125747
Cover Image
The bicriterion multimodal assignment problem : introduction, analysis, and experimental results
Pedersen, Christian Roed; Nielsen, Lars Relund; … - In: INFORMS journal on computing : JOC 20 (2008) 3, pp. 400-411
Persistent link: https://www.econbiz.de/10003770177
Cover Image
The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results
Pedersen, Christian Roed; Nielsen, Lars Relund; … - In: INFORMS journal on computing : JOC 20 (2008) 3, pp. 400-411
Persistent link: https://www.econbiz.de/10008076024
Cover Image
Capacitated Network Design with Uncertain Demand
Riis, Morten; Andersen, Kim Allan - In: INFORMS journal on computing : JOC 14 (2002) 3, pp. 247-260
Persistent link: https://www.econbiz.de/10007108524