Journal: Computers and Operations Research

Found 2748 papers in total
A unified model for Weber problems with continuous and network distances
A unified model for Weber problems with continuous and network distances
2008,
Continuous location problems and network location problems are generally viewed as...
Optimizing the size and locations of facilities in competitive multi-site service systems
Optimizing the size and locations of facilities in competitive multi-site service systems
2008,
We propose a multi-site location–allocation model for selecting locations in...
Regional service coverage modeling
Regional service coverage modeling
2008,
Service coverage is an often utilized concept in location modeling. Whether it be...
The minimum weighted covering location problem with distance constraints
The minimum weighted covering location problem with distance constraints
2008,
The objective is to locate undesirable facilities on a network so as to minimize the...
Dynamic supply chain design with inventory
Dynamic supply chain design with inventory
2008,
In this paper, we deal with a facility location problem where we build new facilities...
Locating a semi-obnoxious facility with expropriation
Locating a semi-obnoxious facility with expropriation
2008,
This paper considers the problem of locating semi-obnoxious facilities assuming that...
A neural model for the p-median problem
A neural model for the p-median problem
2008,
There exist several neural techniques for solving NP-hard combinatorial optimization...
BEAMR: An exact and approximate model for the p-median problem
BEAMR: An exact and approximate model for the p-median problem
2008,
The p -median problem is perhaps one of the most well-known location–allocation...
Solving the maximal covering location problem with heuristic concentration
Solving the maximal covering location problem with heuristic concentration
2008,
The metaheuristic heuristic concentration (HC) is applied here to the solution of...
Using gravity models for the evaluation of new university site locations: A case study
Using gravity models for the evaluation of new university site locations: A case study
2008,
A fundamental aspect of competitive spatial models is the choice behaviour of...
Siting park-and-ride facilities using a multi-objective spatial optimization model
Siting park-and-ride facilities using a multi-objective spatial optimization model
2008,
Park-and-ride services are an important component of many public transportation...
Modeling data envelopment analysis (DEA) efficient location/allocation decisions
Modeling data envelopment analysis (DEA) efficient location/allocation decisions
2008,
Many types of facility location/allocation models have been developed to find optimal...
Employee positioning and workload allocation
Employee positioning and workload allocation
2008,
Assigning tasks to employees is a difficult task. Errors committed in such assignments...
Sensitivity analysis of the knapsack sharing problem: perturbation of the weight of an item
Sensitivity analysis of the knapsack sharing problem: perturbation of the weight of an item
2008,
In this paper, we study the sensitivity analysis of the optimum of the knapsack...
A cross entropy algorithm for the Knapsack problem with setups
A cross entropy algorithm for the Knapsack problem with setups
2008,
In this article we propose a new metaheuristic-based algorithm for the Integer...
Computing all efficient solutions of the biobjective minimum spanning tree problem
Computing all efficient solutions of the biobjective minimum spanning tree problem
2008,
A common way of computing all efficient (Pareto optimal) solutions for a biobjective...
Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
2008,
An approach is proposed for generating homogeneous three-staged cutting patterns for...
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
2008,
The nofit polygon is a powerful and effective tool for handling the geometric...
Solving dynamic stochastic economic models by mathematical programming decomposition methods
Solving dynamic stochastic economic models by mathematical programming decomposition methods
2008,
Discrete-time optimal control problems arise naturally in many economic problems....
Stability analysis of efficient solutions in multiobjective integer programming: a case study in load management
Stability analysis of efficient solutions in multiobjective integer programming: a case study in load management
2008,
This paper presents a multiobjective linear integer programming model for supporting...
Robust multiperiod portfolio management in the presence of transaction costs
Robust multiperiod portfolio management in the presence of transaction costs
2008,
We study the viability of different robust optimization approaches to multiperiod...
Quadratic programming with transaction costs
Quadratic programming with transaction costs
2008,
We consider the problem of maximizing the mean–variance utility function of n...
Neural network-based mean–variance–skewness model for portfolio selection
Neural network-based mean–variance–skewness model for portfolio selection
2008,
In this study, a novel neural network-based mean–variance–skewness model...
Funding and investment decisions in a stochastic defined benefit pension plan with several levels of labor-income earnings
Funding and investment decisions in a stochastic defined benefit pension plan with several levels of labor-income earnings
2008,
In this paper we consider the optimal management of an aggregated dynamic pension...
Papers per page: