Pages that link to "Item:Q4789079"
From MaRDI portal
The following pages link to The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079):
Displaying 29 items.
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371) (← links)
- Algebraic modeling for IP and MIP (GAMS) (Q537584) (← links)
- Applying mod-\(k\)-cuts for solving linear ordering problems (Q839896) (← links)
- Polyhedral analysis for concentrator location problems (Q853560) (← links)
- PEBBL: an object-oriented framework for scalable parallel branch and bound (Q903924) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Linear optimization over permutation groups (Q1019295) (← links)
- Minimizing breaks by maximizing cuts. (Q1400343) (← links)
- Row and column generation technique for a multistage cutting stock problem (Q1603313) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
- Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly (Q2371467) (← links)
- Solving the hub location problem with modular link capacities (Q2387305) (← links)
- OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms (Q2393125) (← links)
- Dantzig-Wolfe decomposition and branch-and-price solving in G12 (Q2430361) (← links)
- A cutting plane algorithm for graph coloring (Q2467348) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- Lagrangian duality applied to the vehicle routing problem with time windows (Q2496037) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- Crossing Minimization in Storyline Visualization (Q2961530) (← links)
- The Influence of Preprocessing on Steiner Tree Approximations (Q3467874) (← links)
- Computing Maximum C-Planar Subgraphs (Q3611845) (← links)
- From High-Level Model to Branch-and-Price Solution in G12 (Q5387632) (← links)
- Integrating operations research in constraint programming (Q5898341) (← links)
- Integrating operations research in constraint programming (Q5900889) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
