PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Aras, Necati"

Author of the publication

copydeleteadd this publication to your clipboard
Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application.

, , and . OR, page 73-78. (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Aras, Necati
add a person with the name Aras, Necati
 

Other publications of authors with the same name

Customer Selection and Profit Maximization in Vehicle Routing Problems., and . OR, page 37-42. (2005)Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks., , and . Computers & OR, (2015)Solving probabilistic multi-facility Weber problem by vector quantization., , and . OR Spectrum, 31 (3): 533-554 (2009)The budget constrained r-interdiction median problem with capacity expansion., , and . CEJOR, 18 (3): 269-291 (2010)Open vehicle routing problem with driver nodes and time deadlines., , and . JORS, 58 (9): 1223-1234 (2007)Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals., , , and . OR, page 101-107. Springer, (2012)A Branch-and-Price Algorithm for Split-Coloring Problem., , and . CTW, page 249-253. (2012)Discrete vector quantization for arbitrary distance function estimation., , and . IEEE Trans. Systems, Man, and Cybernetics, Part B, 28 (4): 496-510 (1998)A two-echelon stochastic facility location model for humanitarian relief logistics., , and . Optimization Letters, 6 (6): 1123-1145 (2012)Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches., , and . Computers & OR, 27 (5): 461-494 (2000)