Journal: TOP

Found 192 papers in total
Weber problems with high-speed lines
2010,
The Weber problem consists of finding a facility which minimizes the sum of weighted...
Conditional median as a robust solution concept for uncapacitated location problems
2010,
While making location decisions, one intends to increase effects (reduce distances)...
The Single Period Coverage Facility Location Problem: Lagrangean heuristic and column generation approaches
2010,
In this paper we introduce the Single Period Coverage Facility Location Problem. It is...
A study of travel time prediction using universal kriging
2010,
This study describes an approach for predicting travel time by kriging. The kriging...
A model and two heuristic approaches for a forage harvester planning problem: a case study
2010,
This work considers a decision problem about orders of owners and routes of...
The multicriteria big cube small cube method
2010,
In this paper we propose the big cube small cube (BCSC) technique for multicriteria...
A computational comparison of several formulations for the multi-period incremental service facility location problem
2010,
The Multi-period Incremental Service Facility Location Problem, which was recently...
A stochastic bi-objective location model for strategic reverse logistics
2010,
In this paper we propose a comprehensive model for reverse logistics planning where...
Lagrangean bounds for the optimum communication spanning tree problem
2010,
This paper considers the Optimum Communication Spanning Tree Problem. An integer...
An Agent-Based framework for modeling and solving location problems
2010,
The high relevance of location problems in the operations research literature arises...
An exact procedure and LP formulations for the leader– follower location problem
2010,
The leader– follower location problem consists of determining an optimal...
Fuzzy goal programming models for analyzing demand coverage
2010,
The main objective of demand coverage models is to locate servers so that a given...
The ordered capacitated facility location problem
2010,
In this paper, we analyze flexible models for capacitated discrete location problems...
Discrete location for bundled demand points
2010,
This paper considers a discrete location problem where the demand points are grouped....
Routing problems with loading constraints
2010,
We consider difficult combinatorial optimization problems arising in transportation...
Timetabling optimization of a single railway track line with sensitivity analysis
2009,
The paper deals with the timetabling problem of a single-track railway line. To solve...
Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
2009,
We consider a Pareto multiobjective optimization problem with a feasible set defined...
Fluid model criterion for instability of re-entrant line with infinite supply of work
2009,
Using a fluid model approach, we obtain a sufficient condition for re-entrant lines...
An approach for solving a modification of the extended rapid transit network design problem
2009,
In this paper we deal with a slight modification of the extended rapid transit network...
Stop location design in public transportation networks: covering and accessibility objectives
2009,
We consider the location of new stops along the edges of an existing public...
Sensitivity analysis of a continuous multifacility competitive location and design problem
2009,
A continuous location problem in which a firm wants to set up two or more new...
An economic order quantity model with partial backlogging under general backorder cost function
2009,
In this work, we study a single-item inventory model where shortages are allowed. A...
Energy-optimal control of unconstrained planar RR robot manipulators
2009,
Given the dynamic model of a planar robot manipulator with two revolute joints, the...
A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations
2009,
In this paper, we consider spanning tree situations, where players want to be...
Papers per page: