The following pages link to ABACUS (Q15484):
Displaying 50 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)
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- A branch and cut solver for the maximum stable set problem (Q491210) (← links)
- Algebraic modeling for IP and MIP (GAMS) (Q537584) (← links)
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization. (Q612873) (← links)
- Branching in branch-and-price: A generic scheme (Q652288) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← 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)
- Applying mod-\(k\)-cuts for solving linear ordering problems (Q839896) (← links)
- Remarks on a surplus-sharing rule from the Mishneh Torah (Q845583) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Polyhedral analysis for concentrator location problems (Q853560) (← links)
- Decision-support with preference constraints (Q857275) (← 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)
- A column generation and branch-and-cut algorithm for the channel assignment problem (Q941544) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Linear optimization over permutation groups (Q1019295) (← links)
- Introduction to ABACUS -- a branch-and-cut system (Q1271386) (← links)
- Plant location with minimum inventory (Q1290654) (← links)
- The \(\gamma\)-connected assignment problem (Q1307813) (← links)
- A modified lift-and-project procedure (Q1365045) (← links)
- Minimizing breaks by maximizing cuts. (Q1400343) (← links)
- Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563) (← links)
- Parallel branch, cut, and price for large-scale discrete optimization (Q1424299) (← links)
- Detecting symmetries by branch and cut. (Q1424304) (← links)
- A polyhedral approach to sequence alignment problems (Q1585327) (← links)
- Row and column generation technique for a multistage cutting stock problem (Q1603313) (← links)
- Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities. (Q1611005) (← links)
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints (Q1681301) (← links)
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors (Q1751173) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- On the fracture behavior of inhomogeneous materials -- a case study for elastically inhomogeneous bimaterials (Q1777188) (← links)
- A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- The biobjective travelling purchaser problem (Q1885751) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
- Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem (Q2122552) (← 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)
- Polyhedral results for the bipartite induced subgraph problem (Q2433802) (← links)
