Parametrized greedy heuristics in theory and practice

Lecture Notes in Computer Science

Volumn 3636, Issue , 2005, Pages 21-31

  Fügenschuh, Armin ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING; REAL TIME SYSTEMS; STRATEGIC PLANNING;

PARAMETER SELECTION; PARAMETRIC SCORING FUNCTIONS; PARAMETRIZED GREEDY HEURISTICS; REAL-WORLD PLANNING PROBLEM;

HEURISTIC METHODS;

EID: 26944493012     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11546245_3     Document Type: Conference Paper

References (7)

1. Bar-Yehuda R., Rawitz D. (2001), Efficient algorithms for integer programs with two variables per constraint. Algorithmica 29 (4), 595 - 609.
2. Lagarias J.C (1985), The computational complexity of simultaneous diophantine approximation problems. SIAM Journal on Computing 14, 196 - 209.
3. ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA. Information available at URL http://www.cplex.com.
4. Savelsbergh M. (1986), Local Search for Routing Problems with Time Windows. Annals of Operations Research 4, 285 - 305.
5. Toth P., Vigo D. (2002), The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia.
6. Zabinsky Z.B. (2003), Stochastic Adaptive Search for Global Optimization. Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Boston.
7. Zabinsky Z.B., Smith R.L., McDonald J.F., Romeijn H.E., Kaufman D.E. (1993), Improving Hit-and-Run for Global Optimization. Journal of Global Optimization 3, 171 - 192.