Template design under demand uncertainty by integer linear local search

References

• Abramson , D , Dang , H and Krishnamoorthy , M . 1996 . A comparison of two methods for solving 0–1 integer programs using a general purpose simulated annealing algorithm . Ann. Oper. Res. , 63 : 129 – 150 .
   Web of Science ®Google Scholar
• Abramson , D and Randall , M . 1999 . A simulated annealing code for general integer linear programs. . Ann. Oper. Res. , 86 : 3 – 24 .
   Google Scholar
• Connolly , D . 1992 . General purpose simulated annealing . J. oper. Res. Soc. , 43 : 495 – 505 .
   Google Scholar
• Hoos , HH and Stützle , T . 2004 . Stochastic Local Search: Foundations and Applications , San Francisco, CA : Morgan Kaufmann .
   Google Scholar
• Lin , S and Kernighan , BW . 1973 . An effective heuristic for the traveling salesman problem . Oper. Res. , 21 : 498 – 516 .
   Web of Science ®Google Scholar
• Lokketangen , A and Glover , F . 1995 . Tabu search for zero–one mixed integer programming with advanced level strategies and learning . Int. J. Oper. quant. Mgmt , 1 : 89 – 108 .
   Google Scholar
• McAllester , DA , Selman , B and Kautz , HA . 1997 . “ Evidence for invariants in local search ” . In Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference 321 – 326 .
   Google Scholar
• Mills , P and Tsang , EPK . 2000 . Guided local search for solving SAT and weighted MAX-SAT problems . J. Automat. Reason. , 24 : 205 – 223 .
   Google Scholar
• Neto , T and Pedroso , JP . 2004 . GRASP for Linear Integer Programming. Metaheuristics: Computer Decision-Making , 545 – 574 . Dordrecht : Kluwer Academic .
   Google Scholar
• Ormond , AJ and Williams , HP . 2004 . “ A survey of different integer programming formulations of the travelling salesman problem ” . UK Working Paper No. LSEOR 04.67, London School of Economics and Political Science
   Google Scholar
• Pedroso , JP . 1998 . “ An evolutionary solver for linear integer programming ” . Japan BSIS Technical Report 98-7, Riken Brain Science Institute, Wako-shi, Saitama
   Google Scholar
• Prestwich , SD . 2003 . Negative effects of modeling techniques on search performance . Ann. Oper. Res. , 118 : 137 – 150 .
   Google Scholar
• Prestwich , SD . 2004 . Incomplete dynamic backtracking for linear pseudo-Boolean problems . Ann. Oper. Res. , 130 : 57 – 73 .
   Google Scholar
• Prestwich , SD . 2005 . “ Random walk with continuously smoothed variable weights ” . In Eighth International Conference on Theory and Applications of Satisfiability Testing , Vol. 3569 , 203 – 215 . Berlin : Springer . Lecture Notes in Computer Science
   Google Scholar
• Prestwich , SD and Roli , A . Second International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems . Berlin. Symmetry breaking and local search spaces , pp. 273 – 287 . Springer . Lecture Notes in Computer Science, Vol. 3524
   Google Scholar
• Proll , L and Smith , BM . 1998 . Integer linear programming and constraint programming approaches to a template design problem . INFORMS J. Comput. , 10 : 265 – 275 .
   Google Scholar
• Selman , B , Kautz , HA and Cohen , B . 1994 . Noise strategies for improving local search . Proceedings of the Twelfth National Conference on Artificial Intelligence , : 337 – 343 .
   Google Scholar
• Tarim , SA and Miguel , I . 2005 . A hybrid Benders' decomposition method for solving stochastic constraint programs with linear recourse . Joint Annual Workshop of ERCIM/CoLogNet ,
   Google Scholar
• Walser , JP . 1997 . Solving linear pseudo-Boolean constraint problems with local search . Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference , : 269 – 274 .
   Google Scholar
• Walser , JP , Iyer , R and Venkatasubramanyan , N . 1998 . An integer local search method with application to capacitated production planning . Fifteenth National Conference on Artificial Intelligence , : 373 – 379 .
   Google Scholar
• Wu , Z and Wah , BW . 2000 . An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems . Proceedings of the Seventeenth National Conference on Artificial Intelligence , : 310 – 315 .
   Google Scholar