Pages that link to "Item:Q1271386"
From MaRDI portal
The following pages link to Introduction to ABACUS -- a branch-and-cut system (Q1271386):
Displaying 14 items.
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- Branching in branch-and-price: A generic scheme (Q652288) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- Design of survivable IP-over-optical networks (Q863570) (← links)
- Solving the asymmetric traveling purchaser problem (Q867540) (← links)
- PEBBL: an object-oriented framework for scalable parallel branch and bound (Q903924) (← links)
- Plant location with minimum inventory (Q1290654) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- The biobjective travelling purchaser problem (Q1885751) (← links)
- A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows (Q2815434) (← links)
- A polyhedral approach to the feedback vertex set problem (Q4645941) (← links)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
