Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 2143861

From MaRDI portal
Publication:4655422
Jump to:navigation, search

zbMATH Open1177.90415MaRDI QIDQ4655422FDOQ4655422

Marc Demange

Publication date: 11 March 2005



Title of this publication is not available (Why is that?)



Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)



Cited In (3)

  • Polynomial approximation algorithms with performance guarantees: an introduction-by-example
  • An Approximation Algorithm for the Three Depots Hamiltonian Path Problem
  • Title not available (Why is that?)


   Recommendations
  • Polynomial approximation algorithms with performance guarantees: an introduction-by-example πŸ‘ πŸ‘Ž
  • An Approximation Algorithm for the Maximum Traveling Salesman Problem πŸ‘ πŸ‘Ž
  • Title not available (Why is that?) πŸ‘ πŸ‘Ž
  • Approximability of hard combinatorial optimization problems: an introduction πŸ‘ πŸ‘Ž
  • Title not available (Why is that?) πŸ‘ πŸ‘Ž





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4655422)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4655422&oldid=18852393"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 16:40. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki