The following pages link to COIN-OR (Q16786):
Displaying 50 items.
- Sequential Bayesian model selection of regular vine copulas (Q273648) (← links)
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- Communication protocols for options and results in a distributed optimization environment (Q298160) (← links)
- A computational study of conflict graphs and aggressive cut separation in integer programming (Q324843) (← links)
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization (Q336664) (← links)
- The positive edge pricing rule for the dual simplex (Q337606) (← links)
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales (Q339577) (← links)
- Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization (Q339591) (← links)
- The positive edge criterion within COIN-OR's CLP (Q342010) (← links)
- Cluster Lagrangean decomposition in multistage stochastic optimization (Q342253) (← links)
- PyOpt: a python-based object-oriented framework for nonlinear constrained optimization (Q381697) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- COAP 2013 Best Paper Prize (Q480919) (← links)
- New error measures and methods for realizing protein graphs from distance data (Q517453) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Shift-and-propagate (Q524884) (← links)
- Some of my favorite integer programming applications at IBM (Q537591) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- Optimization methods for advanced design of aircraft panels: a comparison (Q622597) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) (← links)
- A feasibility pump for mixed integer nonlinear programs (Q1013979) (← links)
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants (Q1043853) (← links)
- Parallelizing the dual revised simplex method (Q1646685) (← links)
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness (Q1683059) (← links)
- On parallel branch and bound frameworks for global optimization (Q1683320) (← links)
- Compact extended linear programming models (Q1693865) (← links)
- Customizing the solution process of COIN-OR's linear solvers with python (Q1694292) (← links)
- A hybrid optimization approach for the Steiner \(k\)-connected network design problem (Q1742248) (← links)
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
- A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems (Q1751680) (← links)
- General cut-generating procedures for the stable set polytope (Q1752480) (← links)
- The demand weighted vehicle routing problem (Q1754023) (← links)
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (Q1761965) (← links)
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees (Q1762093) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- A library hierarchy for implementing scalable parallel search algorithms (Q1771087) (← links)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
- A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems (Q1939068) (← links)
- Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems (Q1939073) (← links)
- A global optimization point of view to handle non-standard object packing problems (Q1941035) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
