COIN-OR

swMATH4615MaRDI QIDQ16786

No author found.

Related Items (only showing first 100 items - show all)

Unnamed Item ⋮ FLOPC++ An Algebraic Modeling Language Embedded in C++ ⋮ Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts ⋮ Integrating operations research in constraint programming ⋮ Pyomo -- optimization modeling in Python ⋮ OpenSolver - An Open Source Add-in to Solve Linear and Integer Progammes in Excel ⋮ On solving strong multistage nonsymmetric stochastic mixed 0-1 problems ⋮ Unnamed Item ⋮ Distributed MPC of constrained linear systems with time-varying terminal sets ⋮ Unnamed Item ⋮ Placement Optimization in Refugee Resettlement ⋮ Three ideas for a feasibility pump for nonconvex MINLP ⋮ Sequential Bayesian model selection of regular vine copulas ⋮ Minotaur: a mixed-integer nonlinear optimization toolkit ⋮ On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming ⋮ 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 ⋮ Maximum feasible subsystems of distance geometry constraints ⋮ Communication protocols for options and results in a distributed optimization environment ⋮ An improved algorithm for solving biobjective integer programs ⋮ A computational study of conflict graphs and aggressive cut separation in integer programming ⋮ Parallelizing the dual revised simplex method ⋮ An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization ⋮ The positive edge pricing rule for the dual simplex ⋮ Heuristics for the multi-item capacitated lot-sizing problem with lost sales ⋮ Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization ⋮ The positive edge criterion within COIN-OR's CLP ⋮ Cluster Lagrangean decomposition in multistage stochastic optimization ⋮ Bound reduction using pairs of linear inequalities ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ PySP: modeling and solving stochastic programs in Python ⋮ OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms ⋮ An empirical evaluation of walk-and-round heuristics for mixed integer linear programs ⋮ Discrete dynamical system approaches for Boolean polynomial optimization ⋮ An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects ⋮ Partial hyperplane activation for generalized intersection cuts ⋮ PyOpt: a python-based object-oriented framework for nonlinear constrained optimization ⋮ A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness ⋮ On parallel branch and bound frameworks for global optimization ⋮ Unnamed Item ⋮ Efficient uncertainty propagation for network multiphysics systems ⋮ A heuristic to generate rank-1 GMI cuts ⋮ Optimization methods for advanced design of aircraft panels: a comparison ⋮ Distance geometry and data science ⋮ A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems ⋮ Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems ⋮ Compact extended linear programming models ⋮ Customizing the solution process of COIN-OR's linear solvers with python ⋮ A global optimization point of view to handle non-standard object packing problems ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms ⋮ The Surgical Patient Routing Problem: A Central Planner Approach ⋮ Intersection cuts from multiple rows: a disjunctive programming approach ⋮ Measuring the impact of primal heuristics ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ COAP 2013 Best Paper Prize ⋮ From feasibility to improvement to proof: three phases of solving mixed-integer programs ⋮ Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON ⋮ A hybrid optimization approach for the Steiner \(k\)-connected network design problem ⋮ MIPLIB 2003 ⋮ An algorithmic framework for convex mixed integer nonlinear programs ⋮ New error measures and methods for realizing protein graphs from distance data ⋮ Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks ⋮ A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems ⋮ General cut-generating procedures for the stable set polytope ⋮ Three enhancements for optimization-based bound tightening ⋮ The demand weighted vehicle routing problem ⋮ The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach ⋮ Optimizing over the split closure ⋮ Projected Chvátal-Gomory cuts for mixed integer linear programs ⋮ Shift-and-propagate ⋮ Some of my favorite integer programming applications at IBM ⋮ Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing ⋮ An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees ⋮ A relax-and-cut framework for Gomory mixed-integer cuts ⋮ The travelling salesman problem with neighbourhoods: MINLP solution ⋮ A library hierarchy for implementing scalable parallel search algorithms ⋮ The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs ⋮ Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming ⋮ A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs ⋮ Unnamed Item ⋮ Newton step methods for AD of an objective defined using implicit functions ⋮ Convex relaxations for mixed-integer nonlinear programs ⋮ Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition ⋮ SCIP: solving constraint integer programs ⋮ Testing cut generators for mixed-integer linear programming ⋮ RENS. The optimal rounding ⋮ A DC Programming Approach for Mixed-Integer Linear Programs ⋮ A feasibility pump for mixed integer nonlinear programs ⋮ An Exact Method for Balancing Efficiency and Equity in the Liver Allocation Hierarchy ⋮ Granularity in nonlinear mixed-integer optimization ⋮ Solving the Static Design Routing and Wavelength Assignment Problem ⋮ An Exploratory Study for Identifying and Implementing Concerns in Integer Programming ⋮ Promising GAHC and HC12 algorithms in global optimization tasks ⋮ Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities ⋮ Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation ⋮ The vehicle routing problem with time windows and temporal dependencies ⋮ Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants ⋮ Bid evaluation in procurement auctions with piecewise linear supply curves ⋮ Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut

This page was built for software: COIN-OR