A short tour of combinatorial optimization and computational complexity

2016 ◽  
pp. 13-39
Author(s):  
Mauricio G. C. Resende ◽  
Celso C. Ribeiro
Keyword(s):  
Computational Complexity ◽  
Combinatorial Optimization ◽  
Short Tour

scholarly journals COST SHARING IN NETWORKS: SOME OPEN QUESTIONS

2013 ◽  
Vol 15 (02) ◽  
pp. 1340001 ◽  
Author(s):  
HERVÉ MOULIN
Keyword(s):  
Computational Complexity ◽  
Combinatorial Optimization ◽  
Cooperative Game ◽  
Cost Sharing ◽  
Optimization Problems ◽  
Fair Division ◽  
Optimal Solutions ◽  
Combinatorial Optimization Problems ◽  
Open Questions

The fertile application of cooperative game techniques to cost sharing problems on networks has so far concentrated on the Stand Alone core test of fairness and/or stability, and ignored many combinatorial optimization problems where this core can be empty. I submit there is much room for an axiomatic discussion of fair division in the latter problems, where Stand Alone objections are not implementable. But the computational complexity of optimal solutions is still a very severe obstacle to this approach.

Combinatorial Optimization Method Based on Evaluation of Proximate Optimality Using Correlation Coefficient

2015 ◽  
Vol 135 (4) ◽  
pp. 466-467 ◽  
Author(s):  
Masahide Morita ◽  
Hiroki Ochiai ◽  
Kenichi Tamura ◽  
Junichi Tsuchiya ◽  
Keiichiro Yasuda
Keyword(s):  
Combinatorial Optimization ◽  
Correlation Coefficient ◽  
Optimization Method
Sign in / Sign up

Export Citation Format

Share Document