Skip to content
Portal K.UTB
  • ikona jazykČeština
  • ikona přihlášení Login
logo knihovny
  • TBU Catalog
  • e-resources
  • E-THESES
Advanced Search
  • An incremental model for combi...
Toolbar
  • ikona citování Cite this
  • ikona bookmark Save to List
  • ikona export Export Record
    • Export to CitacePRO
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
    • Export to RIS
  • ikona email Email this
  • ikona permanent link Permanent link

An incremental model for combinatorial maximization problems

Saved in:
Bibliographic Details
Published inLecture notes in computer science pp. 36 - 48
Main Authors HARTLINE, Jeff, SHARP, Alexa
Format Conference Proceeding
LanguageEnglish
Published Berlin Springer 2006
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Combinatorial problem
Bipartite graph
Combinatorial optimization
Modeling
Graph matching
Knapsack problem
Mathematical programming
Online AccessGet full text

Cover

Loading…
  • More Information
  • Comments
  • Metadata
More Information
ISBN:9783540345978
3540345973
ISSN:0302-9743
  • ikona citování Cite this
  • ikona bookmark Save to List
  • ikona export Export Record
    • Export to CitacePRO
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
    • Export to RIS
  • ikona email Email this
  • ikona permanent link Permanent link

Search Options

  • Search History
  • Browse the Catalog
  • Browse Alphabetically
  • New Items

Find More with K.UTB

  • Opening Hours of the Library
  • Suggestion for Book Purchase
  • Interlibrary Loans
  • Printing and binding of the Theses

Do You Need Help?

  • Search Tips
  • FAQs
  • Feedback
  • Contacts
logo knihovny

Declaration of Accessibility | Cookies

Knihovna UTB ve Zlíně © 2025