Solving some lexicographic multi-objective combinatorial problems
A. Volgenant
Eur. J. Operational Research
139(3):578–584, Jun 2002
Cites:
Finding the $k$ shortest paths
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
