XPRESS
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Multi-item lot-sizing with joint set-up costs
- Simulation and optimization of supply chains: Alternative or complementary approaches?
- Robust optimization of internal transports at a parcel sorting center operated by Deutsche Post world net
- Knapsack problems with setups
- BPMPD
- FATCOP
- SMS++
- mpi-sppy
- jsdp
- HiGHS
- Piece-wise linear approximation of functions of two variables
- SCIP
- Solving a fuel delivery problem by heuristic and exact approaches.
- Dynamic knapsack sets and capacitated lot-sizing
- Identification of piecewise affine systems via mixed-integer programming.
- MaxSolver
- ASYNPLEX
- GASUB
- ABACUS
- A goal programming model for partner selection decisions in international joint ventures
- UG
- AMPL
- SoPlex
- Zimpl
- Supply chain disruption management using stochastic mixed integer programming
- MIPLIB
- CPLEX
- Gurobi
- EMOO
- A robust optimization approach to diet problem with overall glycemic load as objective function
- Pajek datasets
- CVaR distance between univariate probability distributions and approximation problems
- Parallelizing the dual revised simplex method
- GeoSteiner
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
- The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
- A decomposition approach for the \(p\)-median problem on disconnected graphs
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- Cbc
- LINDO
- GLPK
- MINTO
- COIN-OR
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
- TSPTW
- Delay resistant line planning with a view towards passenger transfers
- SYMPHONY
- QSopt_ex
- Compact extended linear programming models
- WSAT(OIP)
- Improved handling of uncertainty and robustness in set covering problems
- FEASPUMP
- SMPS reader
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Mosel
- APLEpy
- COOPR
- FlopC++
- PySP
- SIP
- LINGO
- MIQP
- LEMON
- MIPTS
- DET2STO
- Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
- FIR toolbox
- NLPHOPDM
- MCF
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Stochastic short-term hydropower planning with inflow scenario trees
- An adaptive robust portfolio optimization model with loss constraints based on data-driven polyhedral uncertainty sets
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
- DSP
- Oil production optimization solved by piecewise linearization in a branch \& price framework
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
- Network design formulations for scheduling U.S. air force channel route missions
- Polyhedral approximation in mixed-integer convex optimization
- Valse-XT
- DipPy
- SAS/OR
- SAMPLE
- FiberSCIP
- ParaSCIP
- A penalty function heuristic for the resource constrained shortest path problem
- StAMPL
- McIPM
- CHiPPS
- Some heuristic methods for solving p-median problems with a coverage constraint
- CQP
- A brief history of linear and mixed-integer programming computation
- SITATION
- MOD-DIST
- MENU-OKF
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
- MIPLIB2003
- BEAMR
- Computation of multi-facility location Nash equilibria on a network under quantity competition
- Nash equilibria in location games on a network
This page was built for software: XPRESS
