A CLASS OF EUCLIDEAN ROUTING PROBLEMS WITH GENERAL ROUTE COST FUNCTIONS.

S. Anily; A. Federgruen

doi:10.1287/moor.15.2.268

A CLASS OF EUCLIDEAN ROUTING PROBLEMS WITH GENERAL ROUTE COST FUNCTIONS.

S. Anily, A. Federgruen

Coller School of Management

Research output: Contribution to journal › Article › peer-review

Abstract

Focuses on a study which described a class of euclidean routing problems with general route cost functions. Background on vehicle routing problem; Categories of proposed solution method; Theorem and proof of cost assumption; Complexity of computing the optimal partition.

Original language	English
Pages (from-to)	268-285
Number of pages	18
Journal	Mathematics of Operations Research
Volume	15
Issue number	2
DOIs	https://doi.org/10.1287/moor.15.2.268
State	Published - 1 May 1990

Keywords

Cost
Euclidean algorithm

Access to Document

10.1287/moor.15.2.268

Cite this

@article{7ead496de52b4427b3a68d16522bc9b4,

title = "A CLASS OF EUCLIDEAN ROUTING PROBLEMS WITH GENERAL ROUTE COST FUNCTIONS.",

abstract = "Focuses on a study which described a class of euclidean routing problems with general route cost functions. Background on vehicle routing problem; Categories of proposed solution method; Theorem and proof of cost assumption; Complexity of computing the optimal partition.",

keywords = "Cost, Euclidean algorithm",

author = "S. Anily and A. Federgruen",

year = "1990",

month = may,

day = "1",

doi = "10.1287/moor.15.2.268",

language = "אנגלית",

volume = "15",

pages = "268--285",

journal = "Mathematics of Operations Research",

issn = "0364-765X",

publisher = "INFORMS Institute for Operations Research and the Management Sciences",

number = "2",

}

TY - JOUR

T1 - A CLASS OF EUCLIDEAN ROUTING PROBLEMS WITH GENERAL ROUTE COST FUNCTIONS.

AU - Anily, S.

AU - Federgruen, A.

PY - 1990/5/1

Y1 - 1990/5/1

N2 - Focuses on a study which described a class of euclidean routing problems with general route cost functions. Background on vehicle routing problem; Categories of proposed solution method; Theorem and proof of cost assumption; Complexity of computing the optimal partition.

AB - Focuses on a study which described a class of euclidean routing problems with general route cost functions. Background on vehicle routing problem; Categories of proposed solution method; Theorem and proof of cost assumption; Complexity of computing the optimal partition.

KW - Cost

KW - Euclidean algorithm

U2 - 10.1287/moor.15.2.268

DO - 10.1287/moor.15.2.268

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

SN - 0364-765X

VL - 15

SP - 268

EP - 285

JO - Mathematics of Operations Research

JF - Mathematics of Operations Research

IS - 2

ER -

A CLASS OF EUCLIDEAN ROUTING PROBLEMS WITH GENERAL ROUTE COST FUNCTIONS.

Abstract

Keywords

Access to Document

Fingerprint

Cite this