Results 271 to 280 of about 710,280 (318)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Review, 1974
An expository, completely elementary and self-contained account is given describing several properties of the constraint polytope of the assignment problem. In particular, it is shown that the “Hirsch conjecture” holds, and that to go from any one extreme point to any other, at most 2 extreme edges need to be traversed.
Balinski, M. L., Russakoff, Andrew
openaire +2 more sources
An expository, completely elementary and self-contained account is given describing several properties of the constraint polytope of the assignment problem. In particular, it is shown that the “Hirsch conjecture” holds, and that to go from any one extreme point to any other, at most 2 extreme edges need to be traversed.
Balinski, M. L., Russakoff, Andrew
openaire +2 more sources
In dispute resolution, arbitrator assignments are decentralized and they incorporate parties’ preferences, in total contrast to referee assignments in sports. We suggest that there can be gains (i) in dispute resolution from centralizing the allocation by bundling the newly arriving cases, and (ii) in sports from incorporating teams’ preferences.
Afacan, Mustafa Oğuz +2 more
openaire +1 more source
2007
This chapter surveys recent developments on some basic solution concepts, like stable sets, the core, the nucleolus and the modiclus for a very special class of cooperative games, namely assignment games with transferable utility. The existence of a stable set for assignment games is still an open problem.
Raghavan, T.E.S., Sudhölter, Peter
openaire +2 more sources
This chapter surveys recent developments on some basic solution concepts, like stable sets, the core, the nucleolus and the modiclus for a very special class of cooperative games, namely assignment games with transferable utility. The existence of a stable set for assignment games is still an open problem.
Raghavan, T.E.S., Sudhölter, Peter
openaire +2 more sources
2009
This volume presents a comprehensive view of the huge area of the assignment problem, starting from the conceptual foundations laid down since the Twenties by the studies on matching problems, and examining in detail theoretical, algorithmic and practical developments of the various assignment problems.
R. Burkard +2 more
openaire +3 more sources
This volume presents a comprehensive view of the huge area of the assignment problem, starting from the conceptual foundations laid down since the Twenties by the studies on matching problems, and examining in detail theoretical, algorithmic and practical developments of the various assignment problems.
R. Burkard +2 more
openaire +3 more sources
1996
The chapters in this manual divide color and color vision into four major topics:The eye and color vision; colors from mixing light or pigmentsThe colors of surfaces and light sources; absorption and emission, refraction, scattering, and diffraction and interferenceColors from interference involving diffraction and thin filmsColors from interference ...
openaire +1 more source
The chapters in this manual divide color and color vision into four major topics:The eye and color vision; colors from mixing light or pigmentsThe colors of surfaces and light sources; absorption and emission, refraction, scattering, and diffraction and interferenceColors from interference involving diffraction and thin filmsColors from interference ...
openaire +1 more source
Approximate Hotlink Assignment
Information Processing Letters, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Evangelos Kranakis +2 more
openaire +2 more sources
Proceedings of the 53rd ACM Technical Symposium on Computer Science Education V. 2, 2022
Nick Parlante +12 more
openaire +1 more source
Nick Parlante +12 more
openaire +1 more source
Proceedings of the 45th ACM technical symposium on Computer science education, 2014
Nick Parlante +8 more
openaire +1 more source
Nick Parlante +8 more
openaire +1 more source

