ABACUS

swMATH2948WikidataQ728658 ScholiaQ728658MaRDI QIDQ15484FDOQ15484

Author name not available (Why is that?)

Official website: http://www.informatik.uni-koeln.de/abacus/

Cited In (only showing first 100 items - show all)

• Lifting and separation procedures for the cut polytope
• OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
• A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• PICO: An object-oriented framework for parallel branch and bound
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• A column generation and branch-and-cut algorithm for the channel assignment problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• Branching in branch-and-price: A generic scheme
• Single-commodity robust network design with finite and hose demand sets
• A tutorial on branch and cut algorithms for the maximum stable set problem
• Minimizing breaks by maximizing cuts.
• Design of survivable IP-over-optical networks
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• A branch-and-cut algorithm for the plant-cycle location problem
• Row and column generation technique for a multistage cutting stock problem
• A branch and cut solver for the maximum stable set problem
• 2006 and 2007 Max-SAT evaluations: contributed instances
• Path inequalities for the vehicle routing problem with time windows
• Lift-and-project for mixed 0-1 programming: recent progress
• Solving the hub location problem in a star–star network
• On a binary distance model for the minimum linear arrangement problem
• Noncommercial software for mixed-integer linear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• An alternative method to crossing minimization on hierarchical graphs
• TSPLIB
• MINTO
• Concorde
• PORTA
• BonsaiG
• Algorithm 864
• PGAPack
• SYMPHONY
• PIGALE
• BiCePS
• ACE+
• Valse-XT
• CHiPPS
• OREX-J
• Hibernate
• MOPS
• OSL
• BEAGLE
• BaPCod
• GENCOL
• bc-prod
• Potent
• COIN/BCP
• LOLIB
• EMOSL
• Symmetric ILP: Coloring and small integers
• bc-opt
• FRAGSTATS
• FCNetLib
• Performance Libraries
• RNAlign
• A polyhedral study of the maximum edge subgraph problem
• A branch and cut algorithm for hub location problems with single assignment
• Projection, lifting and extended formulation integer and combinatorial optimization
• A branch-and-cut algorithm for the pallet loading problem
• FlowPM
• A polyhedral approach to sequence alignment problems
• Polaris
• Introduction to ABACUS -- a branch-and-cut system
• SCIP: solving constraint integer programs
• Airline crew scheduling: state-of-the-art
• Polyhedral results for the bipartite induced subgraph problem
• A tightly integrated modelling and optimisation library: A new framework for rapid algorithm development
• Solving the asymmetric traveling purchaser problem
• A cutting plane algorithm for graph coloring
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• A branch-and-cut algorithm for graph coloring
• Multiprocessor scheduling under precedence constraints: polyhedral results
• Title not available (Why is that?)
• PEBBL: an object-oriented framework for scalable parallel branch and bound
• Cutting planes in integer and mixed integer programming
• Plant location with minimum inventory
• A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem
• Symmetry in integer linear programming
• Formulations and exact algorithms for the vehicle routing problem with time windows
• Lagrangian duality applied to the vehicle routing problem with time windows
• 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
• Title not available (Why is that?)
• Solving the hub location problem with modular link capacities
• Combinatorial optimization and small polytopes
• 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 comparative study of the hypoplasticity and the fabric-dependent dilatant double shearing models for granular materials
• A branch-and-cut approach to the crossing number problem
• Algebraic modeling for IP and MIP (GAMS)
• Applying mod-\(k\)-cuts for solving linear ordering problems
• Linear optimization over permutation groups

This page was built for software: ABACUS