An empirical analysis of exact algorithms for the unbounded knapsack problem

von Becker, Henrique
Veröffentlicht in European journal of operational research (2019)

A study on the pickup and delivery problem with time windows : matheuristics and new instances

von Sartori, Carlo S.
Veröffentlicht in Computers & operations research (2020)

A relax-and-fix and fix-and-optimize algorithm for a Maritime Inventory Routing Problem

von Friske, Marcelo W.
Veröffentlicht in Computers & operations research (2022)

Speeding up dynamic shortest-path algorithms

von Buriol, Luciana S.
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2008)

An iterated sample construction with path relinking method : application to switch allocation in electrical distribution networks

Veröffentlicht in Computers & operations research (2013)

A column generation approach to high school timetabling modeled as a multicommodity flow problem

von Dorneles, Árton P.
Veröffentlicht in European journal of operational research (12017)

A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion

Veröffentlicht in International transactions in operational research (2011)

Simulated annealing for the machine reassignment problem

von Portal, Gabriel M.
Veröffentlicht in ROADEF/EURO Challenge on the Machine Reassignment Problem (2012) ROADEF/EURO Challenge 2012 on the Machine Reassignment Problem (2016)

An integer programming approach for the physician rostering problem

von Wickert, Toni I.
Veröffentlicht in The practice and theory of automated timetabling (2018) (2021)

A biased random-key genetic algorithm for road congestion minimization

Veröffentlicht in Optimization letters (2010)