Journal: Annals of Operations Research

Found 3339 papers in total
Improving airline operational performance through schedule perturbation
Improving airline operational performance through schedule perturbation
2006,
Schedule development is typically the first phase of the airline planning process. We...
The crew timetabling problem: An extension of the crew scheduling problem
The crew timetabling problem: An extension of the crew scheduling problem
2006,
In some urban transportation companies driving periods are short when compared with...
Design of the Federal Express large package sort facility
Design of the Federal Express large package sort facility
2006,
In this paper, two mixed integer programming models, the Aggregate Bin Assignment...
Estimating the cycle time of three-stage material handling systems
Estimating the cycle time of three-stage material handling systems
2006,
Because of high investment costs, the productivity of material handling systems must...
Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles
Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles
2006,
We present the Composite Approach for solving the Capacitated Arc Routing Problem with...
Evaluation of choice set generation algorithms for route choice models
Evaluation of choice set generation algorithms for route choice models
2006,
This paper discusses choice set generation and route choice model estimation for...
A combinatorial user optimal dynamic traffic assignment algorithm
A combinatorial user optimal dynamic traffic assignment algorithm
2006,
This paper introduces a polynomial combinatorial optimization algorithm for the...
Optimisation of timetable-based, stochastic transit assignment models based on the Method of Successive Averages
Optimisation of timetable-based, stochastic transit assignment models based on the Method of Successive Averages
2006,
Public transport assignment models have increased in complexity in order to describe...
Models and algorithms for the optimization of signal settings on urban networks with stochastic assignment models
Models and algorithms for the optimization of signal settings on urban networks with stochastic assignment models
2006,
In this paper models and algorithms for the optimization of signal settings on urban...
Transit passenger origin–destination estimation in congested transit networks with elastic line frequencies
Transit passenger origin–destination estimation in congested transit networks with elastic line frequencies
2006,
This paper deals with the transit passenger origin–destination (O–D)...
Minimum spanning trees in networks with varying edge weights
Minimum spanning trees in networks with varying edge weights
2006,
This paper considers the problem of determining minimum spanning trees in networks in...
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
2006,
In a previous paper, Gouveia and Magnanti found diameter-constrained minimal spanning...
Design of survivable IP-over-optical networks
Design of survivable IP-over-optical networks
2006,
In the past years, telecommunications networks have seen an important evolution with...
Experiments on data reduction for optimal domination in networks
Experiments on data reduction for optimal domination in networks
2006,
We present empirical results on computing optimal dominating sets in networks by means...
LP based heuristics for the multiple knapsack problem with assignment restrictions
LP based heuristics for the multiple knapsack problem with assignment restrictions
2006,
Starting with a problem in wireless telecommunication, we are led to study the...
A note on asymptotic formulae for one-dimensional network flow problems
A note on asymptotic formulae for one-dimensional network flow problems
2006,
This note develops asymptotic formulae for single-commodity network flow problems with...
A theoretical analysis of the cross-nested logit model
A theoretical analysis of the cross-nested logit model
2006,
The emergence of Intelligent Transportation Systems and the associated technologies...
Approximation of the steepest descent direction for the origin–destination matrix adjustment problem
Approximation of the steepest descent direction for the origin–destination matrix adjustment problem
2006,
In this paper, a method to approximate the directions of Clarke's generalized gradient...
Using error bounds to compare aggregated generalized transportation models
Using error bounds to compare aggregated generalized transportation models
2006,
A comparative study of aggregation error bounds for the generalized transportation...
Solving the asymmetric traveling purchaser problem
Solving the asymmetric traveling purchaser problem
2006,
The Asymmetric Traveling Purchaser Problem (ATPP) is a generalization of the...
A preemptive repeat priority queue with resampling: Performance analysis
A preemptive repeat priority queue with resampling: Performance analysis
2006,
In this paper, we analyze a discrete-time preemptive repeat priority queue with...
Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks
Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks
2006,
We consider the routing and wavelength assignment (RWA) in survivable WDM network. A...
Optimizing base station location and configuration in UMTS networks
Optimizing base station location and configuration in UMTS networks
2006,
Radio planning and coverage optimization are critical issues when deploying and...
Top percentile network pricing and the economics of multi-homing
Top percentile network pricing and the economics of multi-homing
2006,
Top-percentile pricing is a relatively new and increasingly popular pricing policy...
Papers per page: