Country: United States

Found 17049 papers in total
Restricted delivery problems on a network
Restricted delivery problems on a network
1997,
We consider a delivery problem on a network in which nodes have supplies or demands...
The online traveling salesman problem against fair adversaries
The online traveling salesman problem against fair adversaries
2001,
In the online traveling saleman problem, requests for visits to cities (points in a...
Linear time dynamic-programming algorithms for new classes of retricted traveling salesman problems: A computational study
Linear time dynamic-programming algorithms for new classes of retricted traveling salesman problems: A computational study
2001,
Consider the following restricted (symmetric or asymmetric) traveling-salesman problem...
The Spanish government uses a discrete multicriteria decision support system to determine data-processing acquisitions
The Spanish government uses a discrete multicriteria decision support system to determine data-processing acquisitions
2001,
Since 1983, all acquisitions of data-processing equipment, consulting services, and...
Multi-Criteria Decision Analysis via Ratio and Difference Judgement
Multi-Criteria Decision Analysis via Ratio and Difference Judgement
2001,
Octane: A new heuristic for pure 0–1 programs
Octane: A new heuristic for pure 0–1 programs
2001,
We propose a new heuristic for pure 0–1 programs, which finds feasible integer...
A relational modeling system for linear and integer programming
A relational modeling system for linear and integer programming
2000,
We discuss an integer linear programming modeling system based on relational algebra....
Inference-based sensitivity analysis for mixed integer/linear programming
Inference-based sensitivity analysis for mixed integer/linear programming
2000,
A new method of sensitivity analysis for mixed integer/linear programming (MILP) is...
A comparison of formulations for the single-airport ground-holding problem with banking constraints
A comparison of formulations for the single-airport ground-holding problem with banking constraints
2000,
Both the single-airport ground-holding problem (GH) and the multi-airport...
Aggregation and mixed integer rounding to solve mixed integer programs
Aggregation and mixed integer rounding to solve mixed integer programs
2001,
In this paper, we discuss the use of mixed integer rounding (MIR) inequalities to...
A note on coefficient adjustment using SOS constraints
A note on coefficient adjustment using SOS constraints
2001,
We examine two coefficient adjustment methods proposed in the literature, and we show...
Representations of the all_different predicate of constraint satisfaction in integer programming
Representations of the all_different predicate of constraint satisfaction in integer programming
2001,
The use of predicates to state constraints in Constraint Satisfaction is explained....
Combining minsum and minmax: A goal programming approach
Combining minsum and minmax: A goal programming approach
2001,
A number of methods for multiple-objective optimization problems (MOP) give as...
Improved dynamic programming methods for optimal control of lumped-parameter stochastic systems
Improved dynamic programming methods for optimal control of lumped-parameter stochastic systems
2001,
New dynamic programming methods are developed to solve stochastic control problems...
Optimal dynamic allocation of treatment and enforcement in illicit drug control
Optimal dynamic allocation of treatment and enforcement in illicit drug control
2001,
There has been considerable debate about what share of drug control resources should...
Dynamic economic lot size models with period-pair-dependent backorders and inventory costs
Dynamic economic lot size models with period-pair-dependent backorders and inventory costs
2001,
Inventory and backorder cost functions in the classical Wagner–Whitin economic...
The dynamic and stochastic knapsack problem with random sized items
The dynamic and stochastic knapsack problem with random sized items
2001,
A resource allocation problem, called the dynamic and stochastic knapsack problem...
Heuristics for the multi-resource generalized assignment problem
Heuristics for the multi-resource generalized assignment problem
2001,
The well-known generalized assignment problem (GAP) involves the identification of a...
Optimal guaranteed return portfolios and the casino effect
Optimal guaranteed return portfolios and the casino effect
2000,
In this paper we address the problem of determining optimal portfolios that may...
State space partitioning methods for stochastic shortest path problems
State space partitioning methods for stochastic shortest path problems
1997,
This paper describes methods for computing measures related to shortest paths in...
Performance analysis and best implementations of old and new algorithms for the open-pit mining problem
Performance analysis and best implementations of old and new algorithms for the open-pit mining problem
2000,
The open-pit mining problem is to determine the contours of a mine, based on economic...
Commodity family extended formulations of uncapacitated fixed charge network flow problems
Commodity family extended formulations of uncapacitated fixed charge network flow problems
1997,
Uncapacitated fixed charge network flow problems are single-commodity flow problems...
A computationally efficient method for nonlinear multicommodity network flow problems
A computationally efficient method for nonlinear multicommodity network flow problems
1997,
In this paper, we present a new method for solving nonlinear multicommodity network...
Online searching
Online searching
2001,
We consider the problem of searching m branches which, with the exception of a common...
Papers per page: