Cited in
(only showing first 100 items - show all)- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- scientific article; zbMATH DE number 754937 (Why is no real title available?)
- Advances in design and implementation of optimization software
- Solving combinatorial optimization problems using Karmarkar's algorithm
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- Plant location with minimum inventory
- MODLER
- On some difficult linear programs coming from set partitioning
- An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function
- New bounds for the height limit of a vertical slope
- A simulated-annealing heuristic for shift scheduling using non-continuously available employees
- The application of valid inequalities to the multi-stage lot-sizing problem
- Integer multicommodity flow problems
- Two controller reduction methods based on convex optimization
- Implementation of an integer optimization platform using object oriented programming
- MIP: Theory and practice -- closing the gap
- scientific article; zbMATH DE number 1287781 (Why is no real title available?)
- Efficient solution of two-stage stochastic linear programs using interior point methods
- Steepest-edge simplex algorithms for linear programming
- BARON: A general purpose global optimization software package
- A note on composite concave quadratic programming
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
- MINTO, a Mixed INTeger Optimizer
- Pivot versus interior point methods: Pros and cons
- Computational Integer Programming and Cutting Planes
- A stochastic 0-1 program based approach for the air traffic flow management problem
- An interactive graphic presentation for multiobjective linear programming.
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Multicommodity network flows: A survey. II: Solution methods
- scientific article; zbMATH DE number 1357789 (Why is no real title available?)
- Solving large scale crew scheduling problems
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function
- A decomposition approach for the fuel-constrained economic power-dispatch problem
- The multiparametric 0-1-integer linear programming problem: A unified approach
- Improving aggregation bounds for two-stage stochastic programs
- Asymmetric risk measures and tracking models for portfolio optimization under uncertainty
- A concurrent processing framework for the set partitioning problem
- A branch-and-cut approach for a generic multiple-product, assembly-system design problem
- On the solution of NP-hard linear complementarity problems
- An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion
- A fast LU update for linear programming
- Routing models and solution procedures for regional less-than-truckload operations
- 0-1 equivalent model representations for air traffic management
- A statistical generalized programming algorithm for stochastic optimization problems
- Presolving in linear programming
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Dynamic factorization in large-scale optimization
- Evolutionary hybrid approaches for generation scheduling in power systems
- scientific article; zbMATH DE number 1322737 (Why is no real title available?)
- scientific article; zbMATH DE number 1271323 (Why is no real title available?)
- Implementing the simplex method for the Optimization Subroutine Library
- The capacitated distribution and waste disposal problem
- A bilevel programming approach to determining tax credits for biofuel production
- A new neural network for solving linear programming problems
- Computational assessment of distributed decomposition methods for stochastic linear programs
- Efficient reformulation for 0-1 programs -- methods and computational results
- scientific article; zbMATH DE number 1049486 (Why is no real title available?)
- Robust capacity planning in semiconductor manufacturing
- An algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix
- An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program
- Short-term work scheduling with job assignment flexibility for a multi-fleet transport system
- Process planning in a fuzzy environment
- An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
- Experimental investigations in combining primal dual interior point method and simplex based LP solvers
- A trust region method for minimization of nonsmooth functions with linear constraints
- scientific article; zbMATH DE number 1054668 (Why is no real title available?)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
- A cutting plane method from analytic centers for stochastic programming
- On solving stochastic production planning problems via scenario modelling
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
- A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
- An exponential‐function reduction method for block‐angular convex programs
- An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Parallel algorithm for solving linear programming problem under conditions of incomplete data
- ALPO
- MSLiP
- ABACUS
- KORBX
- MINTO
- MINOS
- ACCPM
- DEVEX
- MOPS
- GRIN
- QPLIB2014
- QL
- LOLIB
- Algorithm 709
- CUTGEN1
- LINUOA
- Octane
- XA
- CHFACT
- A hybrid genetic/optimization algorithm for a task allocation problem
- Deterministic global optimization for nonlinear model predictive control of hybrid dynamic systems
- Recent developments and future directions in mathematical programming
This page was built for software: OSL
