Cited in
(only showing first 100 items - show all)- From feasibility to improvement to proof: three phases of solving mixed-integer programs
- An exact method for balancing efficiency and equity in the liver allocation hierarchy
- On solving strong multistage nonsymmetric stochastic mixed 0-1 problems
- Testing cut generators for mixed-integer linear programming
- Placement optimization in refugee resettlement
- An improved algorithm for solving biobjective integer programs
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
- PySP: modeling and solving stochastic programs in Python
- Some of my favorite integer programming applications at IBM
- A global optimization point of view to handle non-standard object packing problems
- MIPLIB 2003
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- Pyomo -- optimization modeling in Python
- The surgical patient routing problem: a central planner approach
- Sequential Bayesian model selection of regular vine copulas
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
- An Exploratory Study for Identifying and Implementing Concerns in Integer Programming
- On generalized surrogate duality in mixed-integer nonlinear programming
- OptiLog: a framework for SAT-based systems
- An algorithmic framework for convex mixed integer nonlinear programs
- Integer programming techniques for the nurse rostering problem
- Convex relaxations for mixed-integer nonlinear programs
- Work assignment to and qualification of multi-skilled human resources under knowledge depreciation and company skill level targets
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- A hybrid optimization approach for the Steiner k-connected network design problem
- A feasibility pump for mixed integer nonlinear programs
- Efficient uncertainty propagation for network multiphysics systems
- Maximum feasible subsystems of distance geometry constraints
- General cut-generating procedures for the stable set polytope
- The demand weighted vehicle routing problem
- Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization
- Communication protocols for options and results in a distributed optimization environment
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
- The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
- Bid evaluation in procurement auctions with piecewise linear supply curves
- Distance geometry and data science
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization
- The positive edge criterion within COIN-OR's CLP
- The travelling salesman problem with neighbourhoods: MINLP solution
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Distributed MPC of constrained linear systems with time-varying terminal sets
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- ALPS
- CMIT
- MALLBA
- Sdpsol
- MSLiP
- ASYNPLEX
- GAHC
- MIPLIB
- lpSolve
- Couenne
- KORBX
- SoPlex
- Zimpl
- Cbc
- GLPK
- Concorde
- FEASPUMP
- CppAD
- APLEpy
- COOPR
- FlopC++
- OpenOpt
- OptimJ
- PuLP
- PyGlpk
- PySP
- CLP
- SYMPHONY
- DDSIP
- DET2STO
- LEMON
- PyCOIN
- MCFClass
- XPRESS
- SBB
- Valse-XT
- StAMPL
- OREX-J
- glcCluster
- OQNLP
- MIPLIB2003
- DEVEX
- Hibernate
- Cgllandp
- Dsor
- MOPS
- Zinc
- MCDMlib
- BEAGLE
- MD-jeep
- DINS
- GCG
- SAMCEF
- bc-prod
- BOSS-Quattro
- BBMCL
This page was built for software: COIN-OR
