Integer programming formulations for the elementary shortest path problem

Published 2016 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Integer programming formulations for the elementary shortest path problem
Authors
Keywords
Integer programming, Elementary shortest path, Branch-and-cut, Extended formulations, Subtour elimination constraints
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 252, Issue 1, Pages 122-130
Publisher
Elsevier BV
Online
2016-01-12
DOI
10.1016/j.ejor.2016.01.003

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.