Redirigiendo al acceso original de articulo en 18 segundos...
ARTÍCULO
TITULO

Integer Programming Model for Two-Centered Double Traveling Salesman Problem

Mehmet Fatih Demiral    
Halil Sen    

Resumen

s-

 Artículos similares

       
 
Raida Abuizam    
The Juleno Crystals case illustrates how spreadsheet modeling can be used to solve linear programming problems without the use of algebraic formulations. It also enriches students knowledge on how to use integer linear programming with binary (0-1) varia... ver más

 
Marie-Claude Côté, Bernard Gendron, and Louis-Martin Rousseau     Pág. 151 - 163

 
Rakesh Kawatra    
In this paper we present a new heuristic procedure to solve the degree constrained minimal spanning tree problem. This procedure uses Lagrangian relaxation of the integer programming formulation of the problem to get a lower bound for the optimal objecti... ver más

 
Shin-yi Wu, Lorin M. Hitt, Pei-yu Chen, and G. Anandalingam     Pág. 608 - 622

 
Lulli, G. Sen, S.     Pág. 786 - 796