| Document Date: 2011-10-21 09:58:40
Open Document File Size: 284,74 KBShare Result on Facebook
City Vilnius / Frankfurt / / Company BP / BT / / Country Germany / Lithuania / / / Facility Vilnius University / Institute of Mathematics / Georg Schnitger University of Frankfurt / / IndustryTerm branchand-bound algorithms / possible approximative solutions / polynomial-time algorithms / branch-and-bound algorithms / dynamic programming algorithms / few optimal solutions / approximative solutions / fractional solution / branch-and-bound algorithm / candidate solutions / proof or witness that this solution / partial solutions / temporal solution / / Organization Harder Knapsack ProblemsI Stasys Jukna∗ / 1 Georg Schnitger University of Frankfurt / Institute of Mathematics / Vilnius University / / Person Georg Schnitger / Michael Todd / / Position Corresponding author / / ProgrammingLanguage V / / Technology dynamic programming algorithms / polynomial-time algorithms / branchand-bound algorithms / branch-and-bound algorithm / branch-and-bound algorithms / /
SocialTag |
Yet Harder Knapsack ProblemsI Stasys Jukna∗,1 Georg Schnitger University of Frankfurt, Institut of Computer Science, DFrankfurt, Germany. Abstract