DOIAbstract
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/133597/1/net21683_am.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/133597/2/net21683.pd
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/133597/1/net21683_am.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/133597/2/net21683.pd
International audienceRecent researches in the design of logistic networks have shown that the overa...
In this paper we address the classical Vehicle Routing Problem (VRP), where (at most) $k$ minimum-c...
International audienceThis paper addresses capacitated location-routing problems (CLRP). Those distr...
We study a location-routing problem in the context of capacitated vehicle routing. The input to k-Lo...
An approximation algorithm for an optimization problem runs in polynomial time for all instances and...
Vehicle routing is a class of combinatorial optimization problems in transportation and logistics. M...
An approximation algorithm for an optimization problem runs in polynomial time for all instances and...
AbstractThis paper studies a min–max location-routing problem, which aims to determine both the home...
The capacitated location-routing problem (LRP) consists of opening one or more depots on a given set...
International audienceThis paper addresses the capacitated location-routing problem (CLRP), raised b...
The capacitated location-routing problem (LRP) consists of opening one or more depots on a given set...
Given a set of clients with demands, the Capacitated Vehicle Routing problem is to find a set of tou...
The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well k...
Given $n$ identical objects (pegs), placed at arbitrary initial locations, we consider the problem o...
International audienceRecent researches in the design of logistic networks have shown that the overa...
In this paper we address the classical Vehicle Routing Problem (VRP), where (at most) $k$ minimum-c...
International audienceThis paper addresses capacitated location-routing problems (CLRP). Those distr...
We study a location-routing problem in the context of capacitated vehicle routing. The input to k-Lo...
An approximation algorithm for an optimization problem runs in polynomial time for all instances and...
Vehicle routing is a class of combinatorial optimization problems in transportation and logistics. M...
An approximation algorithm for an optimization problem runs in polynomial time for all instances and...
AbstractThis paper studies a min–max location-routing problem, which aims to determine both the home...
The capacitated location-routing problem (LRP) consists of opening one or more depots on a given set...
International audienceThis paper addresses the capacitated location-routing problem (CLRP), raised b...
The capacitated location-routing problem (LRP) consists of opening one or more depots on a given set...
Given a set of clients with demands, the Capacitated Vehicle Routing problem is to find a set of tou...
The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well k...
Given $n$ identical objects (pegs), placed at arbitrary initial locations, we consider the problem o...
International audienceRecent researches in the design of logistic networks have shown that the overa...
In this paper we address the classical Vehicle Routing Problem (VRP), where (at most) $k$ minimum-c...
International audienceThis paper addresses capacitated location-routing problems (CLRP). Those distr...
Add to ORKG