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
  • Search: subject:"Multi-agent path finding"
Narrow search

Narrow search

Year of publication
Subject
All
Agent-based modeling 2 Agentenbasierte Modellierung 2 Theorie 2 Theory 2 Algorithm 1 Algorithmus 1 Column generation 1 Cutting plane 1 Heuristics 1 Heuristik 1 Logistics provider 1 Logistikunternehmen 1 Multi-agent path finding 1 Multi-agent planning 1 Operations Research 1 Operations research 1 Tourenplanung 1 Valid inequality 1 Vehicle routing problem 1 automated guided vehicle 1 column generation 1 combinatorial Benders cuts 1 conflict-free routing 1 multi-agent path finding 1 multi-agent pickup and delivery 1 vehicle routing problem 1
more ... less ...
Online availability
All
Undetermined 2
Type of publication
All
Article 2
Type of publication (narrower categories)
All
Article in journal 2 Aufsatz in Zeitschrift 2
Language
All
English 2
Author
All
Harabor, Daniel 2 Lam, Edward 2 Stuckey, Peter J. 2 Le Bodic, Pierre 1
Published in...
All
Computers & operations research : and their applications to problems of world concern ; an international journal 1
Source
All
ECONIS (ZBW) 2
Showing 1 - 2 of 2
Cover Image
Optimal multi-agent pickup and delivery using branch-and-cut-and-price algorithms
Lam, Edward; Stuckey, Peter J.; Harabor, Daniel - 2025
Persistent link: https://www.econbiz.de/10015359521
Saved in:
Cover Image
Branch-and-cut-and-price for multi-agent path finding
Lam, Edward; Le Bodic, Pierre; Harabor, Daniel; … - In: Computers & operations research : and their … 144 (2022), pp. 1-13
Persistent link: https://www.econbiz.de/10013264827
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...