Fair optimization and networks: A survey
Optimization models related to designing and operating complex systems are mainly
focused on some efficiency metrics such as response time, queue length, throughput, and …
focused on some efficiency metrics such as response time, queue length, throughput, and …
Computing improved optimal solutions to max–min flexible constraint satisfaction problems
The formal framework for decision making in a fuzzy environment is based on a general max–
min, bottleneck-like optimization problem, proposed by Zadeh. It is also the basis for …
min, bottleneck-like optimization problem, proposed by Zadeh. It is also the basis for …
[書籍][B] Assignment problems: revised reprint
R Burkard, M Dell'Amico, S Martello - 2012 - SIAM
When SIAM asked us to prepare a new edition of this book after less than three years from
publication, we expected a light duty. Just the correction of some typos and imprecisions …
publication, we expected a light duty. Just the correction of some typos and imprecisions …
Assignment problems: A golden anniversary survey
DW Pentico - European Journal of Operational Research, 2007 - Elsevier
Having reached the 50th (golden) anniversary of the publication of Kuhn's seminal article on
the solution of the classic assignment problem, it seems useful to take a look at the variety of …
the solution of the classic assignment problem, it seems useful to take a look at the variety of …
Linear assignment problems and extensions
RE Burkard, E Cela - … of combinatorial optimization: Supplement volume A, 1999 - Springer
Linear Assignment Problems and Extensions | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
Goal assignment and trajectory planning for large teams of interchangeable robots
Abstract This paper presents Goal Assignment and Planning: a computationally tractable,
complete algorithm for generating dynamically feasible trajectories for NN interchangeable …
complete algorithm for generating dynamically feasible trajectories for NN interchangeable …
First-order hybrid Petri nets: a model for optimization and control
F Balduzzi, A Giua, G Menga - IEEE transactions on robotics …, 2000 - ieeexplore.ieee.org
We consider in this paper first-order hybrid Petri nets, a model that consists of continuous
places holding fluid, discrete places containing a nonnegative integer number of tokens, and …
places holding fluid, discrete places containing a nonnegative integer number of tokens, and …
Computational aspects of the maximum diversity problem
JB Ghosh - Operations research letters, 1996 - Elsevier
We address two variations of the maximum diversity problem which arises when m elements
are to be selected from an n-element population based on inter-element distances. We study …
are to be selected from an n-element population based on inter-element distances. We study …
On the lexicographic minimax approach to location problems
W Ogryczak - European Journal of Operational Research, 1997 - Elsevier
When locating public facilities, the distribution of travel distances among the service
recipients is an important issue. It is usually tackled with the minimax (center) solution …
recipients is an important issue. It is usually tackled with the minimax (center) solution …
Solving simultaneous target assignment and path planning efficiently with time-independent execution
Real-time planning for a combined problem of target assignment and path planning for
multiple agents, also known as the unlabeled version of multi-agent path finding (MAPF), is …
multiple agents, also known as the unlabeled version of multi-agent path finding (MAPF), is …