DIP
From MaRDI portal
Cited in
(38)- Decomposition in integer linear programming
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems
- Random sampling and machine learning to understand good decompositions
- Single liner shipping service design
- Partial convexification of general mips by Dantzig-Wolfe reformulation
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- Structure Detection in Mixed-Integer Programs
- ConicBundle
- DSP
- DipPy
- SAS/OR
- MIPLIB2003
- BaPCod
- SIPLIB
- GCG
- hMETIS
- EMOSL
- ddsip
- Decogo
- ISUD
- MIPLIBing
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- strIPlib
- SearchCol
- A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles
- Decomposition, reformulation, and diving in university course timetabling
- Coluna.jl
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition
- Non delayed relax-and-cut algorithms
- On the structure of linear programs with overlapping cardinality constraints
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- A comparison of integer programming models for the partial directed weighted improper coloring problem
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- Decomposition and dynamic cut generation in integer linear programming
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization
This page was built for software: DIP
