COIN-OR

swMATH4615MaRDI QIDQ16786FDOQ16786

Author name not available (Why is that?)

Official website: http://www.coin-or.org/

Cited In (only showing first 100 items - show all)

• On solving strong multistage nonsymmetric stochastic mixed 0-1 problems
• An exact method for balancing efficiency and equity in the liver allocation hierarchy
• Testing cut generators for mixed-integer linear programming
• An improved algorithm for solving biobjective integer programs
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• A global optimization point of view to handle non-standard object packing problems
• Some of my favorite integer programming applications at IBM
• Pyomo -- optimization modeling in Python
• Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
• A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
• Sequential Bayesian model selection of regular vine copulas
• Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
• 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
• Integer programming techniques for the nurse rostering 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
• Bid evaluation in procurement auctions with piecewise linear supply curves
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
• Distance geometry and data science
• The travelling salesman problem with neighbourhoods: MINLP solution
• 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
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• Title not available (Why is that?)
• Title not available (Why is that?)
• A computational study of conflict graphs and aggressive cut separation in integer programming
• A heuristic to generate rank-1 GMI cuts
• Cluster Lagrangean decomposition in multistage stochastic optimization
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems
• A library for continuous convex separable quadratic knapsack problems
• An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
• Optimization methods for advanced design of aircraft panels: a comparison
• Measuring the impact of primal heuristics
• Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
• The positive edge pricing rule for the dual simplex
• Heuristics for the multi-item capacitated lot-sizing problem with lost sales
• RENS. The optimal rounding
• Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems
• A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
• Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
• COAP 2013 Best Paper Prize
• A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems
• Intersection cuts from multiple rows: a disjunctive programming approach
• Three ideas for a feasibility pump for nonconvex MINLP
• Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
• A relax-and-cut framework for Gomory mixed-integer cuts
• charge_assign
• PyPBLib
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
• On parallel branch and bound frameworks for global optimization
• Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
• A DC Programming Approach for Mixed-Integer Linear Programs
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• Outer approximation with conic certificates for mixed-integer convex problems
• The vehicle routing problem with time windows and temporal dependencies
• HiGHS
• Parallelizing the dual revised simplex method
• New error measures and methods for realizing protein graphs from distance data
• Optimizing over the split closure
• Solving chance-constrained optimization problems with stochastic quadratic inequalities
• Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
• Bound reduction using pairs of linear inequalities
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• Three enhancements for optimization-based bound tightening
• Shift-and-propagate
• OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
• PySP: modeling and solving stochastic programs in Python
• MIPLIB 2003
• An algorithmic framework for convex mixed integer nonlinear programs
• A feasibility pump for mixed integer nonlinear programs
• An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
• 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

This page was built for software: COIN-OR