Local search heuristics for two-stage flow shop problems with secondary criterion
Computers and Operations Research
Performance Guarantees of Local Search for Multiprocessor Scheduling
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Locally Optimal Algorithms for Designing Schedules Based on Hopfield Networks
Programming and Computing Software
Structure and complexity of extreme Nash equilibria
Theoretical Computer Science - Game theory meets theoretical computer science
Performance Guarantees of Local Search for Multiprocessor Scheduling
INFORMS Journal on Computing
Convergence time to Nash equilibrium in load balancing
ACM Transactions on Algorithms (TALG)
On the Road to $\mathcal{PLS}$-Completeness: 8 Agents in a Singleton Congestion Game
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Nashification and the coordination ratio for a selfish routing game
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Mathematical and Computer Modelling: An International Journal
Quality of move-optimal schedules for minimizing total weighted completion time
Operations Research Letters
Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
Operations Research Letters
| Hi-index | 0.00 |