Exploiting orbits in symmetric ILP
From MaRDI portal
Publication:1424276
DOI10.1007/s10107-003-0394-6zbMath1082.90070OpenAlexW2017479016MaRDI QIDQ1424276
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0394-6
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Detecting almost symmetries of graphs, Exploiting symmetries in mathematical programming via orbital independence, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Symmetry in Mathematical Programming, ILP approaches to the blockmodel problem, Orbital Independence in Symmetric Mathematical Programs, Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs, Equivalence of Lattice Orbit Polytopes, In situ column generation for a cutting-stock problem, On the bin packing problem with a fixed number of object weights, 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, Dimension reduction for semidefinite programs via Jordan algebras, Handling symmetries in mixed-integer semidefinite programs, 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, Progress in mathematical programming solvers from 2001 to 2020, Symmetry-breaking inequalities for ILP with structured sub-symmetry, Algorithms for highly symmetric linear and integer programs, Domination mappings into the Hamming ball: existence, constructions, and algorithms, Elective course planning, Domain reduction techniques for global NLP and MINLP optimization, Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches, Exploiting symmetry in integer convex optimization using core points, Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Using symmetry to optimize over the Sherali-Adams relaxation, The maximum \(k\)-colorable subgraph problem and orbitopes, 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, The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program, Integer Programming for Classifying Orthogonal Arrays, Orbital shrinking: theory and applications, Hard multidimensional multiple choice knapsack problems, an empirical study, Parallel machine scheduling with tool loading, On solving a hard quadratic 3-dimensional assignment problem, On the geometry of symmetry breaking inequalities, Reformulations in Mathematical Programming: Definitions and Systematics, On the geometry of symmetry breaking inequalities, Presolve Reductions in Mixed Integer Programming, Linear optimization over permutation groups, Insight into the computation of Steiner minimal trees in Euclidean space of general dimension, Unnamed Item, Exploiting Symmetries in Polyhedral Computations, 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, Integer-programming software systems
Uses Software
