OSL

swMATH9295MaRDI QIDQ21280FDOQ21280

Author name not available (Why is that?)

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

• An interactive graphic presentation for multiobjective linear programming.
• A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems
• \(0\)-\(1\) equivalent model representations for air traffic management
• Title not available (Why is that?)
• Title not available (Why is that?)
• An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program
• Experimental investigations in combining primal dual interior point method and simplex based LP solvers
• Title not available (Why is that?)
• An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
• An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
• Recent developments and future directions in mathematical programming
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
• Regularizing functions in many-period production optimization models
• Title not available (Why is that?)
• An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function
• Two controller reduction methods based on convex optimization
• Implementation of an integer optimization platform using object oriented programming
• Title not available (Why is that?)
• A stochastic 0-1 program based approach for the air traffic flow management problem
• Benders-and-cut algorithm for fixed-charge capacitated network design problem
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• Solving large scale crew scheduling problems
• 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
• An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion
• On the solution of NP-hard linear complementarity problems
• Routing models and solution procedures for regional less-than-truckload operations
• A fast LU update for linear programming
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• A statistical generalized programming algorithm for stochastic optimization problems
• Presolving in linear programming
• Dynamic factorization in large-scale optimization
• Title not available (Why is that?)
• Evolutionary hybrid approaches for generation scheduling in power systems
• 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
• Robust capacity planning in semiconductor manufacturing
• An algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix
• Process planning in a fuzzy environment
• Short-term work scheduling with job assignment flexibility for a multi-fleet transport system
• A trust region method for minimization of nonsmooth functions with linear constraints
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
• 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
• An exponential‐function reduction method for block‐angular convex programs
• A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• Deterministic global optimization for nonlinear model predictive control of hybrid dynamic systems
• Parallel algorithm for solving linear programming problem under conditions of incomplete data
• A hybrid genetic/optimization algorithm for a task allocation problem
• Partitioning of sequentially ordered systems using linear programming
• On practical resource allocation for production planning and scheduling with period overlapping setups
• CUTE
• Solving a class of LP problems with a primal-dual logarithmic barrier method
• Pivot rules for linear programming: A survey on recent theoretical developments
• Linear‐quadratic efficient frontiers for portfolio optimization
• Title not available (Why is that?)
• Average shadow price and equilibrium price: a case study of tradable pollution permit markets
• Making a Case for Robust Optimization Models
• Scheduling workforce relief breaks in advance versus in real-time
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• A global approach to crew-pairing optimization
• Implementing interior point linear programming methods in the Optimization Subroutine Library
• Organizing a social event --- A difficult problem of combinatorial optimization
• Introduction to ABACUS -- a branch-and-cut system
• A finite algorithm for global minimization of separable concave programs
• The multidimensional 0-1 knapsack problem: an overview.
• A dual ascent procedure for the set partitioning problem
• An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem
• Multi-level, single-machine lot sizing and scheduling (with initial inventory)
• Ensuring quality in resource constrained project scheduling
• Optimizing nuclear power plant refueling with mixed-integer programming
• SLP-IOR: An interactive model management system for stochastic linear programs
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• 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
• New bounds for the height limit of a vertical slope
• On some difficult linear programs coming from set partitioning
• Integer multicommodity flow problems
• A simulated-annealing heuristic for shift scheduling using non-continuously available employees
• The application of valid inequalities to the multi-stage lot-sizing problem
• Title not available (Why is that?)
• MIP: Theory and practice -- closing the gap
• 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

This page was built for software: OSL