set partitioning problem
Recently Published Documents


TOTAL DOCUMENTS

61
(FIVE YEARS 4)

H-INDEX

10
(FIVE YEARS 2)

2020 ◽  
Vol 32 (3) ◽  
pp. 582-599 ◽  
Author(s):  
Samuel Deleplanque ◽  
Martine Labbé ◽  
Diego Ponce ◽  
Justo Puerto

The discrete ordered median problem (DOMP) is formulated as a set-partitioning problem using an exponential number of variables. Each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting position of their corresponding costs. We develop a column generation approach to solve the continuous relaxation of this model. Then we apply a branch-price-and-cut algorithm to solve small- to large-sized instances of DOMP in competitive computational time.


2019 ◽  
Vol 8 (5) ◽  
pp. 713-744 ◽  
Author(s):  
Adil Tahir ◽  
Guy Desaulniers ◽  
Issmail El Hallaoui

2019 ◽  
Vol 33 ◽  
pp. 146-168 ◽  
Author(s):  
Stefania Pan ◽  
Roberto Wolfler Calvo ◽  
Mahuna Akplogan ◽  
Lucas Létocart ◽  
Nora Touati

2018 ◽  
Vol 6 (2) ◽  
pp. 185-206 ◽  
Author(s):  
Abdelouahab Zaghrouti ◽  
Issmail El Hallaoui ◽  
François Soumis

2018 ◽  
Vol 284 (2) ◽  
pp. 645-671 ◽  
Author(s):  
Abdelouahab Zaghrouti ◽  
Issmail El Hallaoui ◽  
François Soumis

2016 ◽  
Vol 23 (2) ◽  
pp. 175-194 ◽  
Author(s):  
Masaaki Nishino ◽  
Jun Suzuki ◽  
Shunji Umetani ◽  
Tsutomu Hirao ◽  
Masaaki Nagata

Sign in / Sign up

Export Citation Format

Share Document