OSL

MaRDI QIDQ21280swMATHFDO

Official website http://www.cenapad.unicamp.br/parque/manuais/OSL/oslweb/features/lib.htm

Cited in

(only showing first 100 items - show all)

• A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
• Multicommodity network flows: A survey. II: Solution methods
• MINTO, a Mixed INTeger Optimizer
• Pivot versus interior point methods: Pros and cons
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
• Efficient reformulation for 0-1 programs -- methods and computational results
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function
• Dynamic factorization in large-scale optimization
• scientific article; zbMATH DE number 1357789 (Why is no real title available?)
• A bilevel programming approach to determining tax credits for biofuel production
• The multidimensional 0-1 knapsack problem: an overview.
• A decomposition approach for the fuel-constrained economic power-dispatch problem
• Optimizing nuclear power plant refueling with mixed-integer programming
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• Plant location with minimum inventory
• A global approach to crew-pairing optimization
• Implementing interior point linear programming methods in the Optimization Subroutine Library
• BARON: A general purpose global optimization software package
• A stochastic 0-1 program based approach for the air traffic flow management problem
• The multiparametric 0-1-integer linear programming problem: A unified approach
• Deterministic global optimization for nonlinear model predictive control of hybrid dynamic systems
• An exponential‐function reduction method for block‐angular convex programs
• CUTE
• A note on composite concave quadratic programming
• A simulated-annealing heuristic for shift scheduling using non-continuously available employees
• Computational Integer Programming and Cutting Planes
• Robust capacity planning in semiconductor manufacturing
• Parallel algorithm for solving linear programming problem under conditions of incomplete data
• scientific article; zbMATH DE number 1322737 (Why is no real title available?)
• Introduction to ABACUS -- a branch-and-cut system
• On the solution of NP-hard linear complementarity problems
• A dual ascent procedure for the set partitioning problem
• Process planning in a fuzzy environment
• Pivot rules for linear programming: A survey on recent theoretical developments
• Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Efficient solution of two-stage stochastic linear programs using interior point methods
• Short-term work scheduling with job assignment flexibility for a multi-fleet transport system
• Solving a class of LP problems with a primal-dual logarithmic barrier method
• Steepest-edge simplex algorithms for linear programming
• ALPO
• MSLiP
• ABACUS
• KORBX
• MINTO
• MINOS
• ACCPM
• Improving aggregation bounds for two-stage stochastic programs
• DEVEX
• MOPS
• GRIN
• QPLIB2014
• QL
• LOLIB
• Algorithm 709
• CUTGEN1
• LINUOA
• Evolutionary hybrid approaches for generation scheduling in power systems
• Solving large scale crew scheduling problems
• The capacitated distribution and waste disposal problem
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• Routing models and solution procedures for regional less-than-truckload operations
• Benders-and-cut algorithm for fixed-charge capacitated network design problem
• Octane
• XA
• CHFACT
• Presolving in linear programming
• Making a Case for Robust Optimization Models
• Implementing the simplex method for the Optimization Subroutine Library
• A fast LU update for linear programming
• Multi-level, single-machine lot sizing and scheduling (with initial inventory)
• New bounds for the height limit of a vertical slope
• Scheduling workforce relief breaks in advance versus in real-time
• Asymmetric risk measures and tracking models for portfolio optimization under uncertainty
• Ensuring quality in resource constrained project scheduling
• Solving combinatorial optimization problems using Karmarkar's algorithm
• On solving stochastic production planning problems via scenario modelling
• Computational assessment of distributed decomposition methods for stochastic linear programs
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
• SLP-IOR: An interactive model management system for stochastic linear programs
• On some difficult linear programs coming from set partitioning
• A hybrid genetic/optimization algorithm for a task allocation problem
• A cutting plane method from analytic centers for stochastic programming
• A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
• An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion
• A finite algorithm for global minimization of separable concave programs
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• On practical resource allocation for production planning and scheduling with period overlapping setups
• scientific article; zbMATH DE number 1287781 (Why is no real title available?)
• MIP: Theory and practice -- closing the gap
• A trust region method for minimization of nonsmooth functions with linear constraints
• Linear‐quadratic efficient frontiers for portfolio optimization
• \(0\)-\(1\) equivalent model representations for air traffic management
• Average shadow price and equilibrium price: a case study of tradable pollution permit markets
• Integer multicommodity flow problems
• A branch-and-cut approach for a generic multiple-product, assembly-system design problem
• A statistical generalized programming algorithm for stochastic optimization problems
• An algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix

This page was built for software: OSL