EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Multiobjective routing problem...
  • More details
Cover Image

Multiobjective routing problems

Year of publication:
1995
Authors: Boffey, B. ; García, Francisco ; Laporte, Gilbert ; Mesa, Juan ; Pelegrín, Blas
Published in:
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. - Springer. - Vol. 3.1995, 2, p. 167-220
Publisher: Springer
Subject: Hazardous materials | Efficient Solutions | k-Shortest Path Methods
Saved in:
  • More details
Extent:
text/html
Type of publication: Article
Source:
RePEc - Research Papers in Economics
Persistent link: https://www.econbiz.de/10005155635
    • EndNote
    • BibTeX
    • Zotero, Mendeley, RefWorks, ...
    • Text
Saved in favorites
    Similar items by subject
    • On the Efficiency of Standard Contracts the Case of Construction

      Chakravarty, Surajeet, (2004)

    • USING WEIGHTED-SUM FUNCTIONS TO COMPUTE NONSUPPORTED EFFICIENT SOLUTIONS IN MULTIOBJECTIVE COMBINATORIAL-{0,1} PROBLEMS

      SILVA, CARLOS GOMES DA, (2013)

    • Solution approaches for the multiobjective stochastic programming

      Abdelaziz, Fouad Ben, (2012)

    • More ...
    Similar items by person
    • Assessing the efficiency of rapid transit configurations

      Laporte, Gilbert, (1997)

    • A methodology for modelling travel distances by Bias estimation

      Ortega, Francisco, (1998)

    • A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments

      Körner, Mark-Christoph, (2014)

    • More ...
    A service of the
    zbw
    • Sitemap
    • Plain language
    • Accessibility
    • Contact us
    • Imprint
    • Privacy

    Loading...