The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(8 intermediate revisions by 3 users not shown)
label / enlabel / en
 
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
Property / describes a project that uses
 
Property / describes a project that uses: MOPS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LINDO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINOS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OSL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5602518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Algorithm for the Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Characterizations of Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: MOPS -- Mathematical optimization system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to ABACUS -- a branch-and-cut system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving binary cutting stock problems by column generation and branch- and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Airline Crew Scheduling Problems by Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINTO, a Mixed INTeger Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840361 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/1097-024x(200009)30:11<1325::aid-spe342>3.0.co;2-t / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038195012 / rank
 
Normal rank
Property / title
 
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (English)
Property / title: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (English) / rank
 
Normal rank

Latest revision as of 08:49, 30 July 2024

scientific article; zbMATH DE number 1858608
Language Label Description Also known as
English
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
scientific article; zbMATH DE number 1858608

    Statements

    0 references
    0 references
    23 January 2003
    0 references
    combinatorial optimization
    0 references
    branch and cut
    0 references
    branch and price
    0 references
    software frameworks
    0 references
    object-oriented design
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (English)
    0 references

    Identifiers