Back to Results
First PageMeta Content
Operations research / Complexity classes / NP-complete problems / Approximation algorithm / Optimization problem / Reduction / NP / Knapsack problem / Dynamic programming / Theoretical computer science / Applied mathematics / Computational complexity theory


A Theory and Algorithms for Combinatorial Reoptimization? Hadas Shachnai1?? , Gal Tamir1 , and Tami Tamir2 1 2
Add to Reading List

Document Date: 2012-02-29 12:43:33


Open Document

File Size: 122,62 KB

Share Result on Facebook

City

Haifa / Herzliya / /

Company

ACS / J. Bishop Research Fund. / /

Country

Israel / /

/

Event

Company Expansion / /

Facility

The Interdisciplinary Center / /

IndustryTerm

α-approximation algorithms / multiobjective optimization algorithm / reapproximation algorithms / communication services / local-search algorithms / real-life applications / efficient solution / xed-parameter algorithms / binary search / storage systems / given optimal solution / approximate solution / given initial solution / α-approximation algorithm / branch-and-bound algorithm / reapproximation algorithm / reoptimization algorithm / communication networks / approximate solutions / approximation algorithms / /

Organization

School of Computer / Israel Science Foundation / E. and J. Bishop Research Fund / Ministry of Trade / Interdisciplinary Center / Computer Science Department / Technion / /

Position

general model for combinatorial reoptimization / model for combinatorial reoptimization / salesman / /

Product

De / /

Technology

reoptimization algorithm / α-approximation algorithm / local-search algorithms / Reoptimization algorithms / bioinformatics / obtaining reapproximation algorithms / reapproximation algorithm / Use algorithm / α-approximation algorithms / generic 2-approximation algorithm / reapproximation algorithms / multiobjective optimization algorithm / approximation algorithms / branch-and-bound algorithm / xed-parameter algorithms / /

URL

www.negev-initiative.org / /

SocialTag