For Peer Review Incremental Network Optimization: Theory & Algorithms

[1]  Jian Liu,et al.  Real-life locomotive planning: New formulations and computational results , 2008 .

[2]  Jian Liu,et al.  Solving Real-Life Railroad Blocking Problems , 2007, Interfaces.

[3]  Peter J. Regan,et al.  Professional Decision Modeling: Practitioner as Professor , 2006, Interfaces.

[4]  Alok Gupta,et al.  Toward Comprehensive Real-Time Bidder Support in Iterative Combinatorial Auctions , 2005, Inf. Syst. Res..

[5]  John D. C. Little,et al.  Models and Managers: The Concept of a Decision Calculus , 2016, Manag. Sci..

[6]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[7]  Bernard Chazelle,et al.  A minimum spanning tree algorithm with inverse-Ackermann type complexity , 2000, JACM.

[8]  W. Zangwill,et al.  Toward a Theory of Continuous Improvement and the Learning Curve , 1998 .

[9]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[10]  Andrew Wirth,et al.  Interactive Job-Shop Scheduling: How to combine Operations Research Heuristics with Human Abilities , 1995 .

[11]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[12]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[13]  Brian L. Dos Santos,et al.  A Study of User Interface Aids for Model-Oriented Decision Support Systems , 1988 .

[14]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[15]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[16]  P. Rivett.  Principles of Operations Research , 1972 .