1647 | -- | 1655 | Prahalad Venkateshan, Kamlesh Mathur. An efficient column-generation-based algorithm for solving a pickup-and-delivery problem |
1667 | -- | 1677 | S. Kamal Chaharsooghi, Jafar Heydari, Isa Nakhai Kamalabadi. Simultaneous coordination of order quantity and reorder point in a two-stage supply chain |
1678 | -- | 1695 | Yüce Çinar, Hande Yaman. The vendor location problem |
1696 | -- | 1704 | Ismail Capar, Burak Eksioglu, Joseph Geunes. A decision rule for coordination of inventory and transportation in a two-stage supply chain with alternative supply sources |
1705 | -- | 1718 | Marina A. Epelman, Archis Ghate, Robert L. Smith. Sampled fictitious play for approximate dynamic programming |
1719 | -- | 1730 | Michael Schilde, Karl F. Doerner, Richard F. Hartl. Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports |
1731 | -- | 1746 | Claudia Archetti, Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza. Analysis of the maximum level policy in a production-distribution system |
1747 | -- | 1759 | Talal Al-Khamis, Rym M Hallah. A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity |
1760 | -- | 1765 | T. C. Edwin Cheng, Chou-Jung Hsu, Yi-Chi Huang, Wen-Chiung Lee. Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness |
1766 | -- | 1774 | Marco Di Summa, Andrea Grosso, Marco Locatelli. Complexity of the critical node problem over trees |
1775 | -- | 1783 | Hongtao Lei, Gilbert Laporte, Bo Guo. The capacitated vehicle routing problem with stochastic demands and time windows |
1784 | -- | 1791 | Jin-Xiao Chen. Peer-estimation for multiple criteria ABC inventory classification |
1792 | -- | 1804 | Wenxing Zhu, Geng Lin. A dynamic convexized method for nonconvex mixed integer nonlinear programming |
1805 | -- | 1815 | D. Cherubini, A. Fanni, A. Mereu, Antonio Frangioni, C. Murgia, Maria Grazia Scutellà, P. Zuddas. Linear programming models for traffic engineering in 100 survivable networks under combined IS-IS/OSPF and MPLS-TE |
1816 | -- | 1825 | Ross J. W. James, Bernardo Almada-Lobo. Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics |
1826 | -- | 1835 | José A. González, Jordi Castro. A heuristic block coordinate descent approach for controlled tabular adjustment |
1836 | -- | 1844 | Sven Oliver Krumke, Clemens Thielen, Stephan Westphal. Interval scheduling on related machines |
1845 | -- | 1854 | Roberto Aringhieri, Daniele Catanzaro, Marco Di Summa. Optimal solutions for the balanced minimum evolution problem |
1855 | -- | 1866 | Banu Soylu, Selda Kapan Ulusoy. A preference ordered classification for a multi-objective max-min redundancy allocation problem |
1867 | -- | 1876 | Enrico Angelelli, Renata Mansini, Michele Vindigni. Look-ahead heuristics for the dynamic traveling purchaser problem |
1877 | -- | 1896 | Saber M. Elsayed, Ruhul A. Sarker, Daryl Leslie Essam. Multi-operator based evolutionary algorithms for solving constrained optimization problems |