Constraint Orbital Branching
From MaRDI portal
Recommendations
Cites work
- A general backtrack algorithm for the isomorphism problem of combinatorial objects
- A note on some computationally difficult set covering problems
- A probabilistic heuristic for a computationally difficult set covering problem
- An interior point algorithm to solve computationally difficult set covering problems
- Branching on general disjunctions
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Exploiting orbits in symmetric ILP
- Generating Multiple Solutions for Mixed Integer Programming Problems
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 637340 (Why is no real title available?)
- scientific article; zbMATH DE number 3311772 (Why is no real title available?)
- Improved solutions to the Steiner triple covering problem
- Improving bounds on the football pool problem by integer programming and high-throughput computing
- Improving Discrete Model Representations via Symmetry Considerations
- Isomorph-Free Exhaustive Generation
- New constructions for covering designs
- On asymmetric coverings and covering numbers
- On coverings
- Orbital Branching
- Orbitopal Fixing
- Packing and partitioning orbitopes
- Pruning by isomorphism in branch-and-cut
- Small covering designs by branch-and-cut
- Solving hard set covering problems
Cited in
(17)- A branch-and-price-and-cut method for computing an optimal bramble
- Orbital shrinking: theory and applications
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
- Solving large Steiner Triple Covering Problems
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
- Symmetry in mathematical programming
- Orbital independence in symmetric mathematical programs
- Optimizing experimental design in genetics
- Orbitopal fixing
- Fundamental domains for symmetric optimization: construction and search
- Orbital Branching
- Orbital branching
- Russian doll search for the Steiner triple covering problem
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- The maximum k-colorable subgraph problem and orbitopes
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
This page was built for publication: Constraint Orbital Branching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503850)
