Back to Results
First PageMeta Content



Minimal Perturbation Problem – A Formal View* Roman Barták1, Tomáš Müller1, Hana Rudová2 1 Charles University, Faculty of Mathematics and Physics Malostranské nám. 2/25, Prague, Czech Republic
Add to Reading List

Document Date: 2007-06-01 09:40:27

Open Document

File Size: 39,08 KB

Share Result on Facebook

City

Prague / Brno / /

Company

AAAI Press / SIAM Journal / Kamil Vermirovský Limited / John Wiley & Sons / /

Country

United States / Czech Republic / /

/

Facility

Charles University / University Course Timetabling / Masaryk University / Purdue University / /

IndustryTerm

acceptable solution / generated solution / incomplete iterative search algorithm / subsequent solutions / local search / incomplete search / resultant solution / good partial solution / search algorithm / local search techniques / search algorithm starts / real-life applications / problem solution / partial solution / assignment number search / search tree / constraint satisfaction technology / secondary algorithm / /

Organization

Faculty of Mathematics and Physics Malostranské nám / Purdue University / Charles University / Faculty of Informatics Botanická / Masaryk University / Grant Agency of the Czech Republic / /

Person

Tomáš Müller / El Sakkout / Thomas Richards / Neil Haven / Keith Murray / Greger Ottosson / Paul Walton Purdom / Jr. / Mark Wallace / Olivier Lhomme / Bjorn Carlson / Narendra Jussien / Hana Rudová / Roman Barták / Stefan Voß / Ingrid Russell / /

Position

editor / /

ProgrammingLanguage

Prolog / C* / /

PublishedMedium

SIAM Journal on Computing / /

Technology

LAN / search algorithm / secondary algorithm / hybridization / incomplete iterative search algorithm / Secondary Algorithm The secondary algorithm / backtracking-based search algorithm / solving algorithm / LAN search algorithm / artificial intelligence / solving algorithms / Assignment Number Search Algorithm / constraint satisfaction technology / /

SocialTag