Constraint Orbital Branching (Q3503850): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_16 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1608844619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Discrete Model Representations via Symmetry Considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and partitioning orbitopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbitopal Fixing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general backtrack algorithm for the isomorphism problem of combinatorial objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorph-Free Exhaustive Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pruning by isomorphism in branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbital Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving hard set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching on general disjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on some computationally difficult set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior point algorithm to solve computationally difficult set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved solutions to the Steiner triple covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Multiple Solutions for Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting orbits in symmetric ILP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On asymmetric coverings and covering numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: New constructions for covering designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small covering designs by branch-and-cut / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:33, 28 June 2024

scientific article
Language Label Description Also known as
English
Constraint Orbital Branching
scientific article

    Statements

    Constraint Orbital Branching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 June 2008
    0 references

    Identifiers