Constraint Orbital Branching
From MaRDI portal
Publication:3503850
DOI10.1007/978-3-540-68891-4_16zbMath1143.90361OpenAlexW1608844619MaRDI QIDQ3503850
Stefano Smriglio, Jeff Linderoth, James Ostrowski, Fabrizio Rossi
Publication date: 10 June 2008
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_16
Related Items
Symmetry in Mathematical Programming, Orbital Independence in Symmetric Mathematical Programs, Optimizing experimental design in genetics, Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays, Orbitopal fixing, Orbital branching, Russian doll search for the Steiner triple covering problem, Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem, Reformulations in mathematical programming: automatic symmetry detection and exploitation, The maximum \(k\)-colorable subgraph problem and orbitopes, A branch-and-price-and-cut method for computing an optimal bramble, Solving large Steiner Triple Covering Problems, Orbital shrinking: theory and applications, Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II, Fundamental Domains for Symmetric Optimization: Construction and Search
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved solutions to the Steiner triple covering problem
- Branching on general disjunctions
- Packing and partitioning orbitopes
- A general backtrack algorithm for the isomorphism problem of combinatorial objects
- A probabilistic heuristic for a computationally difficult set covering problem
- An interior point algorithm to solve computationally difficult set covering problems
- Pruning by isomorphism in branch-and-cut
- Small covering designs by branch-and-cut
- Exploiting orbits in symmetric ILP
- Solving hard set covering problems
- On coverings
- Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing
- Improving Discrete Model Representations via Symmetry Considerations
- A note on some computationally difficult set covering problems
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- New constructions for covering designs
- Isomorph-Free Exhaustive Generation
- On asymmetric coverings and covering numbers
- Orbitopal Fixing
- Orbital Branching
- Generating Multiple Solutions for Mixed Integer Programming Problems
