Keyword: programming: linear

Found 1928 papers in total
Credit risk optimization with Conditional Value-at-Risk criterion
Credit risk optimization with Conditional Value-at-Risk criterion
2001,
This paper examines a new approach for credit risk optimization. The model is based on...
Another heuristic for minimizing total average cycle stock subject to practical constraints
Another heuristic for minimizing total average cycle stock subject to practical constraints
2001,
This paper considers the setting of reorder intervals of a population of items for...
Solving large single allocation p-hub problems with two or three hubs
Solving large single allocation p-hub problems with two or three hubs
2001,
In this paper we present an efficient approach for solving single allocation p -hub...
Maximal flow network modelling of production bottleneck problems
Maximal flow network modelling of production bottleneck problems
2001,
This paper considers the analysis of process networks with bottlenecks and shows how...
Optimization guided lower and upper bounds for the resource investment problem
Optimization guided lower and upper bounds for the resource investment problem
2001,
The resource investment problem deals with the issue of providing resources to a...
A linear programming approach to stability, optimisation and performance analysis for Markovian multiclass queueing networks
A linear programming approach to stability, optimisation and performance analysis for Markovian multiclass queueing networks
1999,
Our object of study is a multiclass queueing network which consists of a collection of...
An algorithm for minimum wait draining of two-station fluid re-entrant line
An algorithm for minimum wait draining of two-station fluid re-entrant line
1999,
In a fluid re-entrant line, fluid moves through a sequence of K buffers, partitioned...
Optimal control of service for facilities holding inventory
Optimal control of service for facilities holding inventory
2001,
This paper addresses the problem of optimally controlling service rates for an...
Dual-based optimization of cyclic three-day workweek scheduling
Dual-based optimization of cyclic three-day workweek scheduling
2000,
An optimization method is presented for the cyclic labour scheduling problem, in which...
Stochastic version of the economic lot size model
Stochastic version of the economic lot size model
1996,
A stochastic version of the classical economic lot size model where demands are random...
Optimal throughput for multistage input–output processes
Optimal throughput for multistage input–output processes
2001,
This paper considers productivity optimization for serial processes for which multiple...
Production scheduling in the tobacco processing industry – a disaggregation approach
Production scheduling in the tobacco processing industry – a disaggregation approach
2000,
In this paper a disaggregation approach to solving a production scheduling problem in...
The Québec Ministry of Natural Resources uses linear programming to understand the wood-fiber market
The Québec Ministry of Natural Resources uses linear programming to understand the wood-fiber market
2000,
In spring 1996, Québec's Ministry of Natural Resources began using a...
The calculation of shadow prices for industrial wastes using distance functions: An analysis for Spanish ceramic pavements firms
The calculation of shadow prices for industrial wastes using distance functions: An analysis for Spanish ceramic pavements firms
2001,
This paper deals with the calculation of shadow prices for two industrial wastes...
Bilevel programming applied to optimising urban tranportation
Bilevel programming applied to optimising urban tranportation
2001,
This paper outlines a multi-modal, elastic, equilibrium transportation model in which...
A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flows
A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flows
2001,
This paper deals with two mathematically similar problems in transport network...
Gadgets, approximation, and linear programming
Gadgets, approximation, and linear programming
2000,
We present a linear programming-based method for finding ‘gadgets,’ i.e.,...
On the core of ordered submodular cost games
On the core of ordered submodular cost games
2000,
A general ordertheoretic linear programming model for the study of matroid-type greedy...
A strategic, area-wide contingency planning model for oil spill cleanup operations with application demonstrated to the Galveston Bay Area
A strategic, area-wide contingency planning model for oil spill cleanup operations with application demonstrated to the Galveston Bay Area
1996,
This paper develops a general integer programming model for strategic, area-wide...
Minimal-revenue congestion pricing Part II: An efficient algorithm for the general case
Minimal-revenue congestion pricing Part II: An efficient algorithm for the general case
2000,
The second of a two-part series, this paper derives an efficient solution to the...
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
1995,
The family of network optimization problems includes the following prototype models:...
A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
1998,
This paper presents an algorithm for finding the minimum flow in general ( s,t )...
Mass transportation problems with capacity constraints
Mass transportation problems with capacity constraints
1999,
We exhibit solutions of Monge–Kantorovich mass transportation problems with...
A parallel shortest augmenting path algorithm for the assignment problem
A parallel shortest augmenting path algorithm for the assignment problem
1991,
A parallel version of the shortest augmenting path algorithm for the assignment...
Papers per page: