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)

• 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
• Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
• Computational experience with a software framework for parallel integer programming
• Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
• Disjunctions of Horn theories and their cores
• Maximally violated mod-\(p\) cuts for the capacitated vehicle-routing problem
• Title not available (Why is that?)
• A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
• MDPLIB
• Remarks on a surplus-sharing rule from the Mishneh Torah
• A branch-and-price approach for large-scale employee tour scheduling problems
• The \(\gamma\)-connected assignment problem
• Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
• Polyhedral analysis for concentrator location problems
• Decision-support with preference constraints
• Title not available (Why is that?)
• Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
• Title not available (Why is that?)
• An integer programming approach to optimal basic block instruction scheduling for single-issue processors
• Experiments on Exact Crossing Minimization Using Column Generation
• Title not available (Why is that?)
• Design of survivable IP-over-optical networks
• Bidirected and unidirected capacity installation in telecommunication networks.
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
• 2006 and 2007 Max-SAT evaluations: contributed instances
• On a binary distance model for the minimum linear arrangement problem
• Dantzig-Wolfe decomposition and branch-and-price solving in G12
• Contraction-based separation and lifting for solving the max-cut problem
• Experiments with the Fixed-Parameter Approach for Two-Layer Planarization
• On the fracture behavior of inhomogeneous materials -- a case study for elastically inhomogeneous bimaterials
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• Detecting symmetries by branch and cut.
• Preprocessing Steiner problems from VLSI layout
• A polyhedral study of the maximum edge subgraph problem
• Introduction to ABACUS -- a branch-and-cut system
• Polyhedral results for the bipartite induced subgraph problem
• Title not available (Why is that?)
• Integrating operations research in constraint programming
• Title not available (Why is that?)
• Parallel branch, cut, and price for large-scale discrete optimization
• An ILP-based Proof System for the Crossing Number Problem
• Title not available (Why is that?)
• A modified lift-and-project procedure
• Title not available (Why is that?)
• Integrating operations research in constraint programming
• Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly
• Computational Integer Programming and Cutting Planes
• Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization
• Title not available (Why is that?)
• Correlation functions of integrable models: A description of the <scp>ABACUS</scp> algorithm
• An automatic simulation tool for thermal analysis of gravity dams by BFM
• Crossing Minimization in Storyline Visualization
• On the base-\(b\) expansion of the number of trailing zeros of \(b^k\)!
• A new analytical solution to the optimal control problem for the control of higher-order non-dispersive wave
• The variable sequencing approach: A solution to the capital budget allocation model
• The influence of preprocessing on Steiner tree approximations
• 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.
• 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
• 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
• Noncommercial software for mixed-integer linear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• AGD
• ALPS
• An alternative method to crossing minimization on hierarchical graphs
• TSPLIB
• PICO
• SALSA
• DSATUR
• CALMA
• OR-Library
• SteinLib
• MINTO
• Concorde
• PORTA

This page was built for software: ABACUS