Branch-and-cut for linear programs with overlapping SOS1 constraints
暂无分享,去创建一个
[1] Timo Berthold,et al. Measuring the impact of primal heuristics , 2013, Oper. Res. Lett..
[2] John J. H. Forrest,et al. Practical Solution of Large Mixed Integer Programming Problems with Umpire , 1974 .
[3] G. Owen. Cutting planes for programs with disjunctive constraints , 1973 .
[4] George L. Nemhauser,et al. Facets of the Complementarity Knapsack Polytope , 2002, Math. Oper. Res..
[5] S. J. Chung. NP-Completeness of the linear complementarity problem , 1989 .
[6] Edward G. Coffman,et al. Mutual Exclusion Scheduling , 1996, Theor. Comput. Sci..
[7] Wilhelm Hummeltenberg. Implementations of special ordered sets in MP software , 1984 .
[8] G. Nemhauser,et al. The mixed vertex packing problem , 2000 .
[9] BronCoen,et al. Algorithm 457: finding all cliques of an undirected graph , 1973 .
[10] Charles Audet,et al. New Branch-and-Cut Algorithm for Bilevel Linear Programming , 2004 .
[11] Tobias Achterberg,et al. Constraint integer programming , 2007 .
[12] Cid C. de Souza,et al. Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph , 2016, Discret. Optim..
[13] Kathryn A. Dowsland,et al. Nurse scheduling with tabu search and strategic oscillation , 1998, Eur. J. Oper. Res..
[14] Buyang Cao,et al. Transportation problem with nonlinear side constraints a branch and bound approach , 1992, ZOR Methods Model. Oper. Res..
[15] Timo Berthold. Heuristic algorithms in global MINLP solvers , 2014 .
[16] Martin W. P. Savelsbergh,et al. Conflict graphs in solving integer programming problems , 2000, Eur. J. Oper. Res..
[17] Tobias Achterberg,et al. SCIP: solving constraint integer programs , 2009, Math. Program. Comput..
[18] Robert G. Jeroslow,et al. Representability in mixed integer programmiing, I: Characterization results , 1987, Discret. Appl. Math..
[19] Klaus Jansen. An Approximation Scheme for Bin Packing with Conflicts , 1999, J. Comb. Optim..
[20] J. A. Tomlin,et al. Special ordered sets and an application to gas supply operations planning , 1988, Math. Program..
[21] Yiwei Thomas Hou,et al. How to correctly use the protocol interference model for multi-hop wireless networks , 2009, MobiHoc '09.
[22] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[23] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[24] Martin W. P. Savelsbergh,et al. Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..
[25] Ulrich Pferschy,et al. The Knapsack Problem with Conflict Graphs , 2009, J. Graph Algorithms Appl..
[26] Koichi Yamazaki,et al. A note on greedy algorithms for the maximum weighted independent set problem , 2003, Discret. Appl. Math..
[27] Mitsuo Gen,et al. Solving exclusionary side constrained transportation problem by using a hybrid spanning tree-based genetic algorithm , 2003, J. Intell. Manuf..
[28] Pierre Bonami,et al. Heuristics for convex mixed integer nonlinear programs , 2012, Comput. Optim. Appl..
[29] Lili Qiu,et al. Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.
[30] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[31] Toshihide Ibaraki. APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS , 1980 .
[32] Michel Bénichou,et al. The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results , 1977, Math. Program..
[33] T. Ibaraki,et al. THE MULTIPLE-CHOICE KNAPSACK PROBLEM , 1978 .
[34] Thorsten Koch,et al. Branching rules revisited , 2005, Oper. Res. Lett..
[35] Mhand Hifi,et al. Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem , 2007, Comput. Oper. Res..
[36] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[37] George L. Nemhauser,et al. Branch-and-cut for combinatorial optimization problems without auxiliary binary variables , 2001, The Knowledge Engineering Review.
[38] Jing Hu,et al. On linear programs with linear complementarity constraints , 2011, Journal of Global Optimization.
[39] Christian Kanzow,et al. Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints , 2011, Mathematical Programming.
[40] Katta G. Murty,et al. Linear complementarity, linear and nonlinear programming , 1988 .
[41] Minghe Sun,et al. A Tabu Search Heuristic Procedure for Solving the Transportation Problem with Exclusionary Side Constraints , 1998, J. Heuristics.
[42] Khaoula Hamdi,et al. AN ITERATED LOCAL SEARCH FOR THE VEHICLE ROUTING PROBLEM WITH CONFLICTS , 2010 .
[43] Marc E. Pfetsch,et al. On the structure of linear programs with overlapping cardinality constraints , 2020, Discret. Appl. Math..
[44] Jing Hu,et al. On the Global Solution of Linear Programs with Linear Complementarity Constraints , 2008, SIAM J. Optim..
[45] Hanif D. Sherali,et al. A Complementarity-based Partitioning and Disjunctive Cut Algorithm for Mathematical Programming Problems with Equilibrium Constraints , 2006, J. Glob. Optim..
[46] C. Bron,et al. Algorithm 457: finding all cliques of an undirected graph , 1973 .
[47] Egon Balas,et al. A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming , 2003, Math. Program..
[48] Ming Zhao,et al. Branch-and-cut for complementarity-constrained optimization , 2014, Math. Program. Comput..
[49] George L. Nemhauser,et al. A polyhedral study of the cardinality constrained knapsack problem , 2002, Math. Program..