A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F03%3A00002393" target="_blank" >RIV/00216208:11320/03:00002393 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report
Original language description
A description of the branch and bound algorithm to solve minimal perturbation problems.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 22nd Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG 2003)
ISBN
1368-5708
ISSN
—
e-ISSN
—
Number of pages
11
Pages from-to
1-11
Publisher name
University of Strathclyde
Place of publication
Glasgow
Event location
Glasgow
Event date
Jan 1, 2003
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—