ABACUS
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A branch-and-cut approach to the crossing number problem
- A comparative study of the hypoplasticity and the fabric-dependent dilatant double shearing models for granular materials
- Lifting and separation procedures for the cut polytope
- OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
- 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
- Disjunctions of Horn theories and their cores
- Maximally violated mod-\(p\) cuts for the capacitated vehicle-routing problem
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
- Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
- scientific article; zbMATH DE number 1187168 (Why is no real title available?)
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- PICO: An object-oriented framework for parallel branch and bound
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- Remarks on a surplus-sharing rule from the Mishneh Torah
- scientific article; zbMATH DE number 1487879 (Why is no real title available?)
- A branch-and-price approach for large-scale employee tour scheduling problems
- Correlation functions of integrable models: A description of the <scp>ABACUS</scp> algorithm
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- The -connected assignment problem
- A column generation and branch-and-cut algorithm for the channel assignment problem
- Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- Polyhedral analysis for concentrator location problems
- Decision-support with preference constraints
- An automatic simulation tool for thermal analysis of gravity dams by BFM
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
- scientific article; zbMATH DE number 1749222 (Why is no real title available?)
- scientific article; zbMATH DE number 5540194 (Why is no real title available?)
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- Branching in branch-and-price: A generic scheme
- Single-commodity robust network design with finite and hose demand sets
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- scientific article; zbMATH DE number 5021774 (Why is no real title available?)
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- Experiments on Exact Crossing Minimization Using Column Generation
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Minimizing breaks by maximizing cuts.
- scientific article; zbMATH DE number 2084276 (Why is no real title available?)
- Design of survivable IP-over-optical networks
- Bidirected and unidirected capacity installation in telecommunication networks.
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- A branch-and-cut algorithm for the plant-cycle location problem
- A branch and cut solver for the maximum stable set problem
- Row and column generation technique for a multistage cutting stock problem
- 2006 and 2007 Max-SAT evaluations: contributed instances
- Lift-and-project for mixed 0-1 programming: recent progress
- Path inequalities for the vehicle routing problem with time windows
- On a binary distance model for the minimum linear arrangement problem
- 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
- Hibernate
- MOPS
- OSL
- BEAGLE
- BaPCod
- GENCOL
- bc-prod
- Potent
- COIN/BCP
- LOLIB
- EMOSL
- bc-opt
- FRAGSTATS
- FCNetLib
- Performance Libraries
- RNAlign
- FlowPM
- Polaris
- Solving the hub location problem in a star–star network
- Crossing Minimization in Storyline Visualization
- On the base-\(b\) expansion of the number of trailing zeros of \(b^k\)!
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- Noncommercial software for mixed-integer linear programming
This page was built for software: ABACUS
