Similar Search Results

A 2.75-approximation algorithm for the unconstrained traveling tournament problem

Imahori, Shinji; Matsui, Tomomi; Miyashiro, Ryuhei - In: The practice and theory of automated timetabling : …, (pp. 237-247). 2014

Persistent link: https://www.econbiz.de/10010381934

A fast and simple algorithm for computing market equilibria

Fleischer, Lisa; Garg, Rahul; Kapoor, Sanjiv; … - In: Internet and network economics : 4th international …, (pp. 19-30). 2008

Persistent link: https://www.econbiz.de/10003792316

Hyperbush algorithm for strategy-based equilibrium traffic assignment problems

Xu, Zhandong; Xie, Jun; Liu, Xiaobo; Nie, Yu - In: Transportation science 56 (2022) 4, pp. 877-903

Persistent link: https://www.econbiz.de/10013365629

Computing integral solutions of complementarity problems

Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2004

In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The … algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying … dimension. Conditions are stated under which the algorithm terminates with a simplex one of whose vertices is an integral …

Persistent link: https://www.econbiz.de/10011343323