Related references
Note: Only part of the references are listed.A parallel multi-population biased random-key genetic algorithm for a container loading problem
Jose Fernando Goncalves et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
A genetic algorithm for lot sizing and scheduling under capacity constraints and allowing backorders
Jose Fernando Goncalves et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2011)
Biased random-key genetic algorithms for combinatorial optimization
Jose Fernando Goncalves et al.
JOURNAL OF HEURISTICS (2011)
Bilinear modeling solution approach for fixed charge network flow problems
Steffen Rebennack et al.
OPTIMIZATION LETTERS (2009)
A genetic algorithm for the resource constrained multi-project scheduling problem
J. F. Goncalves et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2008)
Packet reordering in networks with heavy-tailed delays
Marc Lelarge
MATHEMATICAL METHODS OF OPERATIONS RESEARCH (2008)
Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
Artyom Nahapetyan et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2008)
A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
Jose Fernando Goncalves
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
A hop constrained min-sum arborescence with outage costs
Rakesh Kawatra
COMPUTERS & OPERATIONS RESEARCH (2007)
Heuristic solutions for general concave minimum cost network flow problems
Dalila B. M. M. Fontes et al.
NETWORKS (2007)
The Dandelion code: A new coding of spanning trees for genetic algorithms
Evan Thompson et al.
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2007)
A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
Dalila B. M. M. Fontes et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)
A Branch-and-Bound algorithm for concave Network Flow Problems
DBMM Fontes et al.
JOURNAL OF GLOBAL OPTIMIZATION (2006)
Recent network design techniques using evolutionary algorithms
M Gen et al.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2005)
A hybrid genetic algorithm for the job shop scheduling problem
JF Gonçalves et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2005)
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
L Gouveia et al.
COMPUTERS & OPERATIONS RESEARCH (2005)
Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem
YJ Lee et al.
COMPUTER COMMUNICATIONS (2005)
A branch and bound algorithm for the robust spanning tree problem with interval data
R Montemanni et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2005)
An evolutionary algorithm for manufacturing cell formation
JF Gonçalves et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2004)
Upper bounds minimum-cost for single-source uncapacitated concave network flow problems
DBMM Fontes et al.
NETWORKS (2003)
Edge sets: An effective evolutionary coding of spanning trees
GR Raidl et al.
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2003)
A hybrid genetic algorithm for assembly line balancing
JF Gonçalves et al.
JOURNAL OF HEURISTICS (2002)
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
RK Ahuja et al.
MATHEMATICAL PROGRAMMING (2001)
Network design techniques using adapted genetic algorithms
M Gen et al.
ADVANCES IN ENGINEERING SOFTWARE (2001)
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
L Gouveia et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2001)
Share Paper
