ABACUS
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Linear optimization over permutation groups
- Introduction to ABACUS -- a branch-and-cut system
- AGD
- ALPS
- Plant location with minimum inventory
- The -connected assignment problem
- A modified lift-and-project procedure
- TSPLIB
- Minimizing breaks by maximizing cuts.
- Bidirected and unidirected capacity installation in telecommunication networks.
- Parallel branch, cut, and price for large-scale discrete optimization
- Detecting symmetries by branch and cut.
- PICO
- SALSA
- DSATUR
- CALMA
- A polyhedral approach to sequence alignment problems
- Row and column generation technique for a multistage cutting stock problem
- Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
- SteinLib
- OR-Library
- MINTO
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
- SYMPHONY
- Concorde
- PORTA
- PGAPack
- BonsaiG
- Algorithm 864
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors
- PIGALE
- A branch and cut algorithm for hub location problems with single assignment
- On the fracture behavior of inhomogeneous materials -- a case study for elastically inhomogeneous bimaterials
- A branch-and-cut algorithm for the pallet loading problem
- Combinatorial optimization and small polytopes
- Valse-XT
- BiCePS
- ACE+
- The biobjective travelling purchaser problem
- Locating median cycles in networks
- CHiPPS
- OREX-J
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- Hibernate
- MOPS
- Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
- OSL
- BEAGLE
- BaPCod
- GENCOL
- bc-prod
- Potent
- Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly
- Solving the hub location problem with modular link capacities
- OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- Polyhedral results for the bipartite induced subgraph problem
- COIN/BCP
- LOLIB
- A cutting plane algorithm for graph coloring
- Formulations and exact algorithms for the vehicle routing problem with time windows
- A branch-and-price approach for large-scale employee tour scheduling problems
- Symmetric ILP: Coloring and small integers
- Multiprocessor scheduling under precedence constraints: polyhedral results
- A branch-and-cut algorithm for graph coloring
- Lagrangian duality applied to the vehicle routing problem with time windows
- EMOSL
- The two-dimensional bin packing problem with variable bin sizes and costs
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- An alternative method to crossing minimization on hierarchical graphs
- PICO: An object-oriented framework for parallel branch and bound
- Disjunctions of Horn theories and their cores
- Maximally violated mod-p cuts for the capacitated vehicle-routing problem
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
- Computational experience with a software framework for parallel integer programming
- Single-commodity robust network design with finite and hose demand sets
- Crossing Minimization in Storyline Visualization
- On the base-b expansion of the number of trailing zeros of b^k!
- scientific article; zbMATH DE number 2084276 (Why is no real title available?)
- scientific article; zbMATH DE number 2084313 (Why is no real title available?)
- A branch-and-cut algorithm for the k-edge connected subgraph problem
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
- Contraction-based separation and lifting for solving the max-cut problem
- bc-opt
- Noncommercial software for mixed-integer linear programming
- Experiments with the Fixed-Parameter Approach for Two-Layer Planarization
- The influence of preprocessing on Steiner tree approximations
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- Symmetry in integer linear programming
- Correlation functions of integrable models: A description of the <scp>ABACUS</scp> algorithm
- 2006 and 2007 Max-SAT evaluations: contributed instances
- scientific article; zbMATH DE number 5540194 (Why is no real title available?)
- A new analytical solution to the optimal control problem for the control of higher-order non-dispersive wave
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- The variable sequencing approach: A solution to the capital budget allocation model
- scientific article; zbMATH DE number 1187154 (Why is no real title available?)
- scientific article; zbMATH DE number 1187167 (Why is no real title available?)
- scientific article; zbMATH DE number 1187168 (Why is no real title available?)
- Lifting and separation procedures for the cut polytope
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
This page was built for software: ABACUS
