The following pages link to ABACUS (Q15484):
Displaying 50 items.
- 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-price approach for large-scale employee tour scheduling problems (Q2468738) (← links)
- Symmetric ILP: Coloring and small integers (Q2471273) (← links)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- Lagrangian duality applied to the vehicle routing problem with time windows (Q2496037) (← links)
- The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- An alternative method to crossing minimization on hierarchical graphs (Q2719241) (← links)
- PICO: An object-oriented framework for parallel branch and bound (Q2768018) (← links)
- Disjunctions of Horn theories and their cores (Q2784452) (← links)
- Maximally violated mod-\(p\) cuts for the capacitated vehicle-routing problem (Q2892303) (← links)
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem (Q2892309) (← links)
- Computational experience with a software framework for parallel integer programming (Q2901073) (← links)
- Crossing Minimization in Storyline Visualization (Q2961530) (← links)
- On the base $b$ expansion of the number of trailing zeroes of $b^k!$ (Q3011592) (← links)
- (Q3043715) (← links)
- (Q3043780) (← links)
- A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation (Q3057179) (← links)
- (Q3094163) (← links)
- (Q3372341) (← links)
- Experiments with the Fixed-Parameter Approach for Two-Layer Planarization (Q3378513) (← links)
- The Influence of Preprocessing on Steiner Tree Approximations (Q3467874) (← links)
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case (Q3544267) (← links)
- Symmetry in Integer Linear Programming (Q3565246) (← links)
- Correlation functions of integrable models: A description of the <scp>ABACUS</scp> algorithm (Q3583594) (← links)
- (Q3604009) (← links)
- (Q3619067) (← links)
- (Q3622469) (← links)
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem (Q3637400) (← links)
- (Q3639627) (← links)
- Consecutive ones and a betweenness problem in computational biology (Q3840361) (← links)
- (Q3840374) (← links)
- (Q3840375) (← links)
- (Q4263720) (← links)
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition (Q4427317) (← links)
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (Q4458720) (← links)
- (Q4471661) (← links)
- The Ring Star Problem: Polyhedral analysis and exact algorithm (Q4474293) (← links)
- (Q4494408) (← links)
- (Q4532225) (← links)
- An ILP-based Proof System for the Crossing Number Problem (Q4606298) (← links)
- A branch-and-cut algorithm for the plant-cycle location problem (Q4661044) (← links)
- (Q4668573) (← links)
- (Q4735935) (← links)
- (Q4735940) (← links)
- Preprocessing Steiner problems from VLSI layout (Q4785218) (← links)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
