Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289)

From MaRDI portal

Revision as of 17:37, 17 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Multiobjective transportation network design and routing problems: Taxonomy and annotation	scientific article

Statements

scholarly article

0 references

Multiobjective transportation network design and routing problems: Taxonomy and annotation (English)

0 references

0 references

European Journal of Operational Research

0 references

publication date

24 August 1993

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

An empirical investigation of some bicriterion shortest path algorithms

0 references

Generalized dynamic programming for multicriteria optimization

0 references

Scheduling unit processing time jobs on a single machine with multiple criteria

0 references

Interactive decision support for multiobjective transportation problems

0 references

Multiobjective programming and planning

0 references

Shortest paths in networks with vector weights

0 references

Multiobjective analysis of facility location decisions

0 references

The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks

0 references

An interactive approach to identify the best compromise solution for two objective shortest path problems

0 references

A goal approach to assembly line balancing

0 references

Shortest-path algorithms: Taxonomy and annotation

0 references

Exact and approximate algorithms for optimal network design

0 references

Multiple criteria approach to the facilities layout problem

0 references

The multiobjective equilibrium network design problem revisited: A simulated annealing approach

0 references

Approximation of convex curves with application to the bicriterial minimum cost flow problem

0 references

Time-cost tradeoff in a three-dimensional assignment problem

0 references

Time-Cost Trade-Off Analysis in Some Constrained Assignment Problems

0 references

An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department

0 references

0 references

The shortest path problem with two objective functions

0 references

0 references

Maximal Direct Covering Tree Problems

0 references

Indirect covering tree problems on spanning tree networks

0 references

Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon

0 references

Algorithms to solve the orienteering problem: A comparison

0 references

Equitable Demand Adjustment for Infeasible Transportation Problems

0 references

Bicriteria network flow problems: Continuous case

0 references

Multiple objective programming for the quadratic assignment problem

0 references

On a special class of bicriterion path problems

0 references

On a particular quadratic network problem

0 references

A parametric approach to solving bicriterion shortest path problems

0 references

A methodology for multicriteria network partitioning

0 references

A solver for the multi-objective transshipment problem with facility location

0 references

A quadratic integer program for the location of interacting hub facilities

0 references

0 references

A Weighting Function for Pre-emptive Multicriteria Assignment Problems

0 references

0 references

Interactive solutions for the linear multiobjective transportation problem

0 references

Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh

0 references

Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems

0 references

Multiobjective routing of hazardous materials in stochastic networks

0 references

Optimization in Multiple-objective Linear Programming Problems with Pre-emptive Priorities

0 references

An Interactive Programming Method for Solving the Multiple Criteria Problem

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0377-2217(93)90140-I

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2368289

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2368289&oldid=34108906"