Pruning by isomorphism in branch-and-cut
From MaRDI portal
Publication:1396814
DOI10.1007/s10107-002-0358-2zbMath1023.90088OpenAlexW2914155449MaRDI QIDQ1396814
Publication date: 13 July 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/Pruning_by_Isomorphism_in_Branch-and-Cut/6707579
Related Items
Detecting almost symmetries of graphs, Exploiting symmetries in mathematical programming via orbital independence, Symmetry in Mathematical Programming, Orbital Independence in Symmetric Mathematical Programs, Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs, In situ column generation for a cutting-stock problem, Lexicographical order in integer programming, A supernodal formulation of vertex colouring with applications in course timetabling, Polytopes associated with symmetry handling, SYMMETRIES IN MODAL LOGICS, Spherical cuts for integer programming problems, Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays, Optimization for Power Systems and the Smart Grid, Constraint Orbital Branching, Orbitopal fixing, Packing, partitioning, and covering symresacks, Orbital branching, Algorithms for highly symmetric linear and integer programs, Domain reduction techniques for global NLP and MINLP optimization, Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches, Packing and partitioning orbitopes, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Using symmetry to optimize over the Sherali-Adams relaxation, Stabilizer-based symmetry breaking constraints for mathematical programs, The maximum \(k\)-colorable subgraph problem and orbitopes, Exact algorithms for the solution of the grey pattern quadratic assignment problem, A computational comparison of symmetry handling methods for mixed integer programs, Symmetric ILP: Coloring and small integers, A branch-and-price-and-cut method for computing an optimal bramble, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions, Classification of orthogonal arrays by integer programming, Solving large Steiner Triple Covering Problems, Integer Programming for Classifying Orthogonal Arrays, Orbital shrinking: theory and applications, Parallel machine scheduling with tool loading, On the geometry of symmetry breaking inequalities, Reformulations in Mathematical Programming: Definitions and Systematics, On the geometry of symmetry breaking inequalities, Insight into the computation of Steiner minimal trees in Euclidean space of general dimension, Unnamed Item, Fundamental Domains for Symmetric Optimization: Construction and Search, Automatic Generation of Symmetry-Breaking Constraints, Modified orbital branching for structured symmetry with an application to unit commitment, Political districting to minimize cut edges, Algorithms for finding generalized minimum aberration designs
Uses Software
