Models and algorithms for network design problems
暂无分享,去创建一个
[1] D. J. Hill,et al. A New Strategy for Transmission Expansion in Competitive Electricity Markets , 2002, IEEE Power Engineering Review.
[2] Vasek Chvátal,et al. Hard Knapsack Problems , 1980, Oper. Res..
[3] Tobias Achterberg,et al. The MCF-Separator – Detecting and Exploiting Multi-Commodity Flows in MIPs , 2010 .
[4] David Pisinger. An exact algorithm for large multiple knapsack problems , 1999, Eur. J. Oper. Res..
[5] John M. Wilson,et al. Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search , 1999, Journal of the Operational Research Society.
[6] Andrzej Ruszczynski,et al. An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems , 2007, Oper. Res..
[7] C. Panne,et al. Minimum-Cost Cattle Feed Under Probabilistic Protein Constraints , 1963 .
[8] Alexander Shapiro,et al. Lectures on Stochastic Programming: Modeling and Theory , 2009 .
[9] R. Ravi,et al. A PTAS for the chance-constrained knapsack problem with random item sizes , 2010, Oper. Res. Lett..
[10] Olivier Klopfenstein,et al. Solving chance-constrained combinatorial problems to optimality , 2010, Comput. Optim. Appl..
[11] J.-P. Vial,et al. A model for robust capacity planning for telecommunications networks under demand uncertainty , 2007, 2007 6th International Workshop on Design and Reliable Communication Networks.
[12] Laura Bahiense,et al. A Mixed Integer Disjunctive Model for Transmission Network Expansion , 2001 .
[13] Zhao Yang Dong,et al. Flexible Transmission Expansion Planning With Uncertainties in an Electricity Market , 2009, IEEE Transactions on Power Systems.
[14] Morten Riis,et al. Capacitated Network Design with Uncertain Demand , 2002, INFORMS J. Comput..
[15] Tobias Achterberg,et al. SCIP: solving constraint integer programs , 2009, Math. Program. Comput..
[16] R. Kevin Wood,et al. A Stochastic Generalized Assignment Problem , 2004 .
[17] Alexander Shapiro,et al. The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..
[18] Geir Dahl,et al. Routing Through Virtual Paths in Layered Telecommunication Networks , 1999, Oper. Res..
[19] Robert J. Vanderbei,et al. Robust Optimization of Large-Scale Systems , 1995, Oper. Res..
[20] A. Capone,et al. MPLS over transport network: two layer approach to network design with statistical multiplexing , 2006, 2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06..
[21] Stefan Voß,et al. A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks , 2006, Eur. J. Oper. Res..
[22] David Huygens,et al. Integer programming formulations for the two 4-hop-constrained paths problem , 2007 .
[23] Michael Poss,et al. A branch-and-cut-and-price framework for convex MINLP applied to a stochastic network design problem , 2010 .
[24] S. Binato,et al. Security-constrained transmission planning : A mixed-integer disjunctive approach , 2004 .
[25] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[26] Dritan Nace,et al. Multiperiod network design with incremental routing , 2007, Networks.
[27] V. Quintana,et al. Generation and Transmission Expansion Under Risk Using Stochastic Programming , 2007, IEEE Transactions on Power Systems.
[28] Michal Pióro,et al. SNDlib 1.0—Survivable Network Design Library , 2010, Networks.
[29] Oded Berman,et al. Facility Location Problems with Stochastic Demands and Congestion , 2002 .
[30] Oktay Günlük,et al. Minimum cost capacity installation for multicommodity network flows , 1998, Math. Program..
[31] Behram Hansotia. Technical Note - Some Special Cases of Stochastic Programs with Recourse , 1977, Oper. Res..
[32] Alysson M. Costa,et al. Benders, metric and cutset inequalities for multicommodity capacitated network design , 2009, Comput. Optim. Appl..
[33] Antonio Frangioni,et al. A stabilized structured Dantzig–Wolfe decomposition method , 2012, Mathematical Programming.
[34] L. Gouveia. Multicommodity flow models for spanning trees with hop constraints , 1996 .
[35] Charles M. Grinstead,et al. Introduction to probability , 1986, Statistics for the Behavioural Sciences.
[36] Maria Grazia Scutellà,et al. Chance Constrained Network Design , 2009 .
[37] Juan José Salazar González,et al. Exact approaches to the single‐source network loading problem , 2012, Networks.
[38] Thomas L. Magnanti,et al. Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..
[39] I. Grossmann,et al. An LP/NLP based branch and bound algorithm for convex MINLP optimization problems , 1992 .
[40] Ali Ridha Mahjoub,et al. The two‐edge connected hop‐constrained network design problem: Valid inequalities and branch‐and‐cut , 2007, Networks.
[41] Richard T. Wong,et al. A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..
[42] Teodor Gabriel Crainic,et al. Service network design in freight transportation , 2000, Eur. J. Oper. Res..
[43] M. Shahidehpour,et al. Network planning in unbundled power systems , 2006, IEEE Transactions on Power Systems.
[44] Ignacio E. Grossmann,et al. An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1986, Math. Program..
[45] Dritan Nace,et al. Multiperiod network design with incremental routing , 2007 .
[46] Patrizia Beraldi,et al. Beam search heuristic to solve stochastic integer problems under probabilistic constraints , 2005, Eur. J. Oper. Res..
[47] D. J. Hill,et al. A New Strategy for Transmission Expansion in Competitive Electricity Markets , 2002, IEEE Power Engineering Review.
[48] Ryuhei Uehara,et al. On Computing Longest Paths in Small Graph Classes , 2007, Int. J. Found. Comput. Sci..
[49] S. Binato,et al. Value-Based Transmission Expansion Planning of Hydrothermal Systems Under Uncertainty , 2007, IEEE Transactions on Power Systems.
[50] M. Shahidehpour,et al. Market based transmission expansion planning: fuzzy risk assessment , 2004, 2004 IEEE International Conference on Electric Utility Deregulation, Restructuring and Power Technologies. Proceedings.
[51] M.J. Rider,et al. Transmission Network Expansion Planning Considering Uncertainty in Demand , 2006, IEEE Transactions on Power Systems.
[52] W. Ben-Ameur. Between fully dynamic routing and robust stable routing , 2007, 2007 6th International Workshop on Design and Reliable Communication Networks.
[53] Luís Gouveia,et al. Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints , 1998, INFORMS J. Comput..
[54] R. Andrade,et al. Telecommunication Network Capacity Design for Uncertain Demand , 2004, Comput. Optim. Appl..
[55] Arie M. C. A. Koster,et al. On cut‐based inequalities for capacitated network design polyhedra , 2011, Networks.
[56] R. Raman,et al. Modelling and computational techniques for logic based integer programming , 1994 .
[57] Jeff T. Linderoth,et al. FilMINT: An Outer-Approximation-Based Solver for Nonlinear Mixed Integer Programs , 2008 .
[58] Alexander Shapiro,et al. Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications , 2009, J. Optimization Theory and Applications.
[59] L. L. Garver,et al. Transmission Network Estimation Using Linear Programming , 1970 .
[60] Maria Grazia Scutellí. On improving optimal oblivious routing , 2009 .
[61] Susan L. Albin,et al. The design of centralized networks with reliability and availability constraints , 1988, Comput. Oper. Res..
[62] René Henrion,et al. Convexity of chance constraints with independent random variables , 2008, Comput. Optim. Appl..
[63] W. W. Hardgrave,et al. On the Relation Between the Traveling-Salesman and the Longest-Path Problems , 1962 .
[64] Dritan Nace,et al. Valid inequalities for a robust knapsack polyhedron - Application to the robust bandwidth packing problem , 2009 .
[65] Alper Atamtürk,et al. On capacitated network design cut–set polyhedra , 2002, Math. Program..
[66] Jorge J. Moré,et al. Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .
[67] Oktay Günlük,et al. Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..
[68] M. Shahidehpour,et al. A Multi-Objective Framework for Transmission Expansion Planning in Deregulated Environments , 2009, IEEE Transactions on Power Systems.
[69] Michael Poss,et al. An improved Benders decomposition applied to a multi-layer network design problem , 2009, Oper. Res. Lett..
[70] Michael Poss,et al. Benders Decomposition for the Hop-Constrained Survivable Network Design Problem , 2013, INFORMS J. Comput..
[71] Ali Ridha Mahjoub,et al. Two Edge-Disjoint Hop-Constrained Paths and Polyhedra , 2005, SIAM J. Discret. Math..
[72] Sara Mattia,et al. The robust network loading problem with dynamic routing , 2010, Comput. Optim. Appl..
[73] J. Gondzio,et al. Capacity Planning under Uncertain Demand in Telecommunication Networks , 1999 .
[74] Michael Poss,et al. Easy distributions for combinatorial optimization problems with probabilistic constraints , 2010, Oper. Res. Lett..
[75] S. Kataoka. A Stochastic Programming Model , 1963 .
[76] Jaeseok Choi. A method for transmission system expansion planning considering probabilistic reliability criteria , 2005, IEEE Transactions on Power Systems.
[77] Patrizia Beraldi,et al. A branch and bound method for stochastic integer problems under probabilistic constraints , 2002, Optim. Methods Softw..
[78] John R. Birge,et al. Introduction to Stochastic programming (2nd edition), Springer verlag, New York , 2011 .
[79] M. Shahidehpour,et al. Congestion-Driven Transmission Planning Considering the Impact of Generator Expansion , 2008, IEEE Transactions on Power Systems.
[80] Ignacio E. Grossmann,et al. An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1987, Math. Program..
[81] Kemal Altinkemer,et al. Using a Hop-Constrained Model to Generate Alternative Communication Network Design , 2015, INFORMS J. Comput..
[82] James R. Luedtke,et al. A Sample Approximation Approach for Optimization with Probabilistic Constraints , 2008, SIAM J. Optim..
[83] Matteo Fischetti,et al. Combinatorial Benders' Cuts for Mixed-Integer Linear Programming , 2006, Oper. Res..
[84] Antonio Sassano,et al. Metric Inequalities and the Network Loading Problem , 2004, IPCO.
[85] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[86] Maria Grazia Scutellà. On improving optimal oblivious routing , 2009, Oper. Res. Lett..
[87] Gilbert Laporte,et al. An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands , 2002, Oper. Res..
[88] Jeff T. Linderoth,et al. Algorithms and Software for Convex Mixed Integer Nonlinear Programs , 2012 .
[89] Patrizia Beraldi,et al. The Probabilistic Set-Covering Problem , 2002, Oper. Res..
[90] Michal Pioro,et al. An IP/MPLS over WDM network design problem , 2005 .
[91] Darinka Dentcheva,et al. Bounds for probabilistic integer programming problems , 2002, Discret. Appl. Math..
[92] Matteo Fischetti,et al. A note on the selection of Benders’ cuts , 2010, Math. Program..
[93] Jørgen Tind,et al. L-shaped decomposition of two-stage stochastic programs with integer recourse , 1998, Math. Program..
[94] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[95] Alysson M. Costa. A survey on benders decomposition applied to fixed-charge network design problems , 2005, Comput. Oper. Res..
[96] Dritan Nace,et al. A robust approach to the chance-constrained knapsack problem , 2008, Oper. Res. Lett..
[97] Z.Y. Dong,et al. A Framework for Transmission Planning in a Competitive Electricity Market , 2005, 2005 IEEE/PES Transmission & Distribution Conference & Exposition: Asia and Pacific.
[98] Cynthia Barnhart,et al. Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..
[99] Robert G. Jeroslow,et al. There Cannot be any Algorithm for Integer Programming with Quadratic Constraints , 1973, Oper. Res..
[100] Irênio De Jesus Silva Junior,et al. Planejamento da expansão de sistemas de transmissão considerando segurança e planos de programação da geração , 2005 .
[101] Teodor Gabriel Crainic,et al. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design , 2001, Discret. Appl. Math..
[102] Robert D. Doverspike,et al. Network planning with random demand , 1994, Telecommun. Syst..
[103] Luís Gouveia,et al. A note on hop-constrained walk polytopes , 2004, Oper. Res. Lett..
[104] Geir Dahl,et al. A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems , 1998, INFORMS J. Comput..
[105] Luís Gouveia,et al. Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees , 2003, Networks.
[106] Anton J. Kleywegt,et al. The Dynamic and Stochastic Knapsack Problem with Random Sized Items , 2001, Oper. Res..
[107] Dritan Nace,et al. A note on polyhedral aspects of a robust knapsack problem , 2007 .
[108] A. Cohn,et al. The Stochastic Knapsack Problem with Random Weights : A Heuristic Approach to Robust Transportation Planning , 1998 .
[109] Fatih Alagoz,et al. Approximations on the Aggregate MPEG Video Traffic and Their Impact on Admission Control , 2002 .
[110] Quentin Botton. Survivable network design with quality of service constraints : extended formulations and Benders decomposition , 2010 .
[111] Antonio Frangioni,et al. 0-1 Reformulations of the Multicommodity Capacitated Network Design Problem , 2009, Discret. Appl. Math..
[112] I. C. da Silva,et al. Transmission system expansion planning using a sigmoid function to handle integer investment variables , 2006, IEEE Transactions on Power Systems.
[113] Jacques F. Benders,et al. Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..
[114] Ilkka Norros,et al. Testing the Gaussian approximation of aggregate traffic , 2002, IMW '02.
[115] Antonio J. Conejo,et al. Transmission expansion planning: a mixed-integer LP approach , 2003 .
[116] Claude Lemaréchal,et al. Comparison of bundle and classical column generation , 2008, Math. Program..
[117] P. Carpentier,et al. Transmission Network Planning Under Uncertainty with Benders Decomposition , 2000 .
[118] Michael Patriksson. Simplicial Decomposition Algorithms , 2009, Encyclopedia of Optimization.
[119] Michel Minoux,et al. Exact solution of multicommodity network optimization problems with general step cost functions , 1999, Oper. Res. Lett..
[120] I. Grossmann. Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques , 2002 .
[121] Patrizia Beraldi,et al. An exact approach for solving integer problems under probabilistic constraints with random technology matrix , 2010, Ann. Oper. Res..
[122] Hasan Pirkul,et al. New formulations and solution procedures for the hop constrained network design problem , 2003, Eur. J. Oper. Res..
[123] Deep Medhi,et al. Routing, flow, and capacity design in communication and computer networks , 2004 .
[124] Giuseppe Carlo Calafiore,et al. Distributionally Robust Chance-Constrained Linear Programs with Applications , 2006 .
[125] A. Ben-Tal,et al. Adjustable robust solutions of uncertain linear programs , 2004, Math. Program..
[126] S. Martello,et al. Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .
[127] Gérard Cornuéjols,et al. An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..
[128] Sven Leyffer,et al. FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs , 2010, INFORMS J. Comput..
[129] Arnaud Knippel,et al. The multi-layered network design problem , 2007, Eur. J. Oper. Res..
[130] M. Pereira,et al. A Mixed Integer Disjunctive Model for Transmission Network Expansion , 2001, IEEE Power Engineering Review.
[131] S. Binato,et al. A Greedy Randomized Adaptive Search Procedure for Transmission Expansion Planning , 2001 .
[132] Jacques Desrosiers,et al. Selected Topics in Column Generation , 2002, Oper. Res..
[133] Fernando Ordóñez,et al. Robust solutions for network design under transportation cost and demand uncertainty , 2008, J. Oper. Res. Soc..
[134] Luís Gouveia,et al. MPLS over WDM network design with packet level QoS constraints based on ILP models , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[135] Abdel Lisser,et al. Upper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm , 2010, Ann. Oper. Res..
[136] Edoardo Amaldi,et al. Provisioning virtual private networks under traffic uncertainty , 2007 .
[137] G. Latorre,et al. Classification of publications and models on transmission expansion planning , 2003 .
[138] Daniel Bienstock,et al. Using mixed-integer programming to solve power grid blackout problems , 2007, Discret. Optim..
[139] Michel Gendreau,et al. Accelerating Benders Decomposition by Local Branching , 2009, INFORMS J. Comput..
[140] Robert M. Nauss,et al. Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach , 2003, INFORMS J. Comput..
[141] Abdel Lisser,et al. B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty , 2005, Ann. Oper. Res..
[142] Sungsoo Park,et al. An Integer Programming Approach to the Bandwidth Packing Problem , 1996 .
[143] Pierre Hansen,et al. Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem , 2009, Discret. Appl. Math..
[144] L. S. Moulin,et al. Transmission expansion planning with re-design , 2010 .
[145] Hande Yaman,et al. The Robust Network Loading Problem under Polyhedral Demand Uncertainty : Formulation , Polyhedral Analysis and Computations ∗ , 2007 .
[146] Patrizia Beraldi,et al. A probabilistic model applied to emergency service vehicle location , 2009, Eur. J. Oper. Res..
[147] Arie M. C. A. Koster,et al. Single-Layer Cuts for Multi-Layer Network Design Problems , 2008 .
[148] Arie M. C. A. Koster,et al. Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics , 2006 .
[149] J. L. Nolan. Stable Distributions. Models for Heavy Tailed Data , 2001 .
[150] Miguel A. Lejeune,et al. MIP reformulations of the probabilistic set covering problem , 2010, Math. Program..
[151] Sebastian Orlowski,et al. An Integer Programming Model for Multi-Layer Network Design , 2004 .
[152] Endre Boros,et al. Minimization of Half-Products , 1998, Math. Oper. Res..