Multi-objective and multi-constrained non-additive shortest path problems

Line Blander Reinhardt; David Pisinger

doi:10.1016/j.cor.2010.08.003

ScienceGate Book Chapters

JOURNAL ARTICLE

Multi-objective and multi-constrained non-additive shortest path problems

Line Blander Reinhardt David Pisinger

Year: 2010 Journal: Computers & Operations Research Vol: 38 (3)Pages: 605-616 Publisher: Elsevier BV

DOI: 10.1016/j.cor.2010.08.003

Get Full-Text PDF Get Analytical Report

Keywords:

Shortest path problem Mathematical optimization Computer science Additive function Path (computing) Dominance (genetics) De facto Mathematics Graph Theoretical computer science

Metrics

Cited By

16.24

FWCI (Field Weighted Citation Impact)

Refs

0.99

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Optimization and Mathematical Programming

Physical Sciences → Engineering → Control and Systems Engineering

Supply Chain and Inventory Management

Social Sciences → Business, Management and Accounting → Management Information Systems

Multi-objective and multi-constrained non-additive shortest path problems

Metrics

Citation History

Topics

Related Documents

An Exact Algorithm to Solve Multi-objective, Multi-Constrained Shortest Path Problems with Forbidden Paths

A multi-objective shortest path problem

The multi-criteria constrained shortest path problem

The fuzzy inference approach to solve multi-objective constrained shortest path problem

The multi-objective dynamic shortest path problem