Cited in
(only showing first 100 items - show all)- A branch-and-cut algorithm for graph coloring
- Multiprocessor scheduling under precedence constraints: polyhedral results
- A branch and cut algorithm for hub location problems with single assignment
- Minimizing breaks by maximizing cuts.
- A branch and cut solver for the maximum stable set problem
- Symmetric ILP: Coloring and small integers
- The two-dimensional bin packing problem with variable bin sizes and costs
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
- Locating median cycles in networks
- The biobjective travelling purchaser problem
- A column generation and branch-and-cut algorithm for the channel assignment problem
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Single-commodity robust network design with finite and hose demand sets
- scientific article; zbMATH DE number 2084777 (Why is no real title available?)
- scientific article; zbMATH DE number 1187154 (Why is no real title available?)
- Plant location with minimum inventory
- PEBBL: an object-oriented framework for scalable parallel branch and bound
- Airline crew scheduling: state-of-the-art
- Projection, lifting and extended formulation integer and combinatorial optimization
- A tutorial on branch and cut algorithms for the maximum stable set problem
- A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem
- Symmetry in integer linear programming
- Solving the hub location problem with modular link capacities
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
- Formulations and exact algorithms for the vehicle routing problem with time windows
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- Lifting and separation procedures for the cut polytope
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- Lift-and-project for mixed 0-1 programming: recent progress
- OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- AGD
- ALPS
- TSPLIB
- PICO
- SALSA
- DSATUR
- CALMA
- OR-Library
- SteinLib
- MINTO
- Concorde
- PORTA
- BonsaiG
- Algorithm 864
- PGAPack
- SYMPHONY
- PIGALE
- BiCePS
- ACE+
- Valse-XT
- CHiPPS
- OREX-J
- scientific article; zbMATH DE number 2084313 (Why is no real title available?)
- scientific article; zbMATH DE number 1749222 (Why is no real title available?)
- Hibernate
- MOPS
- OSL
- BEAGLE
- BaPCod
- GENCOL
- bc-prod
- Potent
- COIN/BCP
- LOLIB
- EMOSL
- scientific article; zbMATH DE number 2090690 (Why is no real title available?)
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- A tightly integrated modelling and optimisation library: A new framework for rapid algorithm development
- bc-opt
- FRAGSTATS
- FCNetLib
- Performance Libraries
- RNAlign
- An alternative method to crossing minimization on hierarchical graphs
- Solving the asymmetric traveling purchaser problem
- SCIP: solving constraint integer programs
- Lagrangian duality applied to the vehicle routing problem with time windows
- FlowPM
- Polaris
- Cutting planes in integer and mixed integer programming
- Combinatorial optimization and small polytopes
- Solving the hub location problem in a star–star network
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- Noncommercial software for mixed-integer linear programming
- A branch-and-cut algorithm for the pallet loading problem
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- A cutting plane algorithm for graph coloring
- A polyhedral approach to sequence alignment problems
- Row and column generation technique for a multistage cutting stock problem
- Path inequalities for the vehicle routing problem with time windows
- A branch-and-cut algorithm for the plant-cycle location problem
- Branching in branch-and-price: A generic scheme
- PICO: An object-oriented framework for parallel branch and bound
- Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
- scientific article; zbMATH DE number 5540194 (Why is no real title available?)
This page was built for software: ABACUS
