A continuous relaxation based heuristic for a class of constrained semi-assignment problems

Download
Abstract (PDF, 160.1Kb)
Fulltext (PDF, 9.045Mb)
Thumbnail
Open access
Author
Burkard, Michael
Date
2000
Type
    Doctoral Thesis
Rights / license
In Copyright - Non-Commercial Use Permitted
Permanent link
https://doi.org/10.3929/ethz-a-003925104
Publication status
published
External links
Search print copy at ETH Library
Contributors
Examiner: Lüthi, Hans-Jakob
Publisher
ETH Zürich
Subject
KOMBINATORISCHE PROBLEME (DISKRETE OPTIMIERUNG); DISKRETE DYNAMISCHE SYSTEME (ANALYSIS); ZUORDNUNGSPROBLEME (LINEARE OPTIMIERUNG); COMBINATORIAL PROBLEMS (DISCRETE PROGRAMMING); DISCRETE DYNAMICAL SYSTEMS (MATHEMATICAL ANALYSIS); ASSIGNMENT PROBLEMS (LINEAR PROGRAMMING)
Organisational unit
03391 - Lüthi, Hans-Jakob  
Notes
Diss. Technische Wissenschaften ETH Zürich, Nr. 13756, 2000.
More
Show all metadata
ETH Bibliography
yes
Altmetrics