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

Latest revision as of 09: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

instance of

scholarly article

0 references

zbMATH Open document ID

1147.90416

0 references

DOI

10.1002/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T

0 references

0 references

0 references

23 January 2003

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

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

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Q3844775

0 references

Outline of an algorithm for integer solutions to linear programs

0 references

An Automatic Method of Solving Discrete Programming Problems

0 references

On the shortest spanning subtree of a graph and the traveling salesman problem

0 references

A note on two problems in connexion with graphs

0 references

Paths, Trees, and Flowers

0 references

Q5602518

0 references

A Cutting Plane Algorithm for the Linear Ordering Problem

0 references

On Linear Characterizations of Combinatorial Optimization Problems

0 references

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

0 references

Q4845366

0 references

Q4840772

0 references

A Linear Programming Approach to the Cutting-Stock Problem

0 references

MOPS -- Mathematical optimization system

0 references

Q4004297

0 references

Introduction to ABACUS -- a branch-and-cut system

0 references

Solving binary cutting stock problems by column generation and branch- and-bound

0 references

A lift-and-project cutting plane algorithm for mixed 0-1 programs

0 references

Q4871778

0 references

Edmonds polytopes and weakly hamiltonian graphs

0 references

Odd Minimum Cut-Sets and <i>b</i>-Matchings

0 references

TSPLIB—A Traveling Salesman Problem Library

0 references

Q3140425

0 references

Solving Airline Crew Scheduling Problems by Branch-and-Cut

0 references

Preprocessing and Probing Techniques for Mixed Integer Programming Problems

0 references

Q4234150

0 references

MINTO, a Mixed INTeger Optimizer

0 references

Q3840375

0 references

Q4249523

0 references

Q3840361

0 references

full work available at URL

https://doi.org/10.1002/1097-024x(200009)30:11<1325::aid-spe342>3.0.co;2-t

0 references

OpenAlex ID

W2038195012

0 references

title

The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (English)

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4789079

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