Bo Chen
Orcid: 0000-0001-7605-9453Affiliations:
- University of Warwick, Warwick Business School, Coventry, UK
- Erasmus Universiteit Rotterdam, Institute of Econometrics, The Netherlands (PhD 1994)
According to our database1,
Bo Chen
authored at least 60 papers
between 1991 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on orcid.org
On csauthors.net:
Bibliography
2024
Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency.
CoRR, 2024
2023
Auton. Agents Multi Agent Syst., October, 2023
Eur. J. Oper. Res., 2023
Auton. Agents Multi Agent Syst., 2023
2022
Math. Oper. Res., November, 2022
Soc. Choice Welf., 2022
Atomic congestion games with random players: network equilibrium and the price of anarchy.
J. Comb. Optim., 2022
2021
J. Sched., 2021
Eur. J. Oper. Res., 2021
Connections between Fairness Criteria and Efficiency for Allocating Indivisible Chores.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021
2020
Found. Trends Technol. Inf. Oper. Manag., 2020
2019
Eur. J. Oper. Res., 2019
2018
2017
Oper. Res., 2017
Eur. J. Oper. Res., 2017
Discret. Appl. Math., 2017
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
2016
J. Sched., 2016
2015
2014
2013
2012
J. Sched., 2012
2011
Expert Syst. Appl., 2011
2010
2009
Networks, 2009
Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design.
Algorithmica, 2009
2008
2006
2005
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem.
Math. Oper. Res., 2005
2004
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time.
J. Comb. Optim., 2004
Discret. Appl. Math., 2004
A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract).
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
2001
J. Oper. Res. Soc., 2001
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
1998
Approximation algorithms for two-machine flow shop scheduling with batch setup times.
Math. Program., 1998
J. Comb. Optim., 1998
1997
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling".
SIAM J. Comput., 1997
Oper. Res. Lett., 1997
1996
1995
1994
Inf. Process. Lett., 1994
1993
A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times.
SIAM J. Comput., 1993
INFORMS J. Comput., 1993
1991
Discret. Appl. Math., 1991