The Shortest Route Cut and Fill problem in linear topological structure

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2005, Pages 409-410

  Songshan, ^a   Li, Guo Weixing ^a   Lim, Andrew ^b   Wang, Fan ^b  

^a SUN YAT SEN UNIVERSITY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Cut and Fill; Optimization

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION; TOPOLOGY;

CUT AND FILL; LINEAR TOPOLOGICAL STRUCTURE; SHORTEST ROUTE CUT AND FILL (SRCF); TOPOLOGICAL STRUCTURE;

LINEAR PROGRAMMING;

EID: 33644537342     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066677.1066772     Document Type: Conference Paper

References (1)

1. D. Henderson, D.E. Vaughan, S.H. Jacobson, R.R. Wakefield, and E.C. Sewell. Solving the shortest route cut and fill problem using simulated annealing. European Journal of Operational Research, 145:72-84, 2003.