The following pages link to ABACUS (Q15484):
Displaying 32 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)
- (Q2768018) (← links)
- Disjunctions of Horn Theories and Their Cores (Q2784452) (← links)
- Maximally Violated Mod-<i>p</i> 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)
- 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)
- Preprocessing Steiner problems from VLSI layout (Q4785218) (← links)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
- A comparative study of the hypoplasticity and the fabric-dependent dilatant double shearing models for granular materials (Q4933130) (← links)
- Path inequalities for the vehicle routing problem with time windows (Q5295485) (← links)
- Solving the hub location problem in a star–star network (Q5433190) (← links)
