Online Linear Optimization over Permutations
From MaRDI portal
Publication:3104653
DOI10.1007/978-3-642-25591-5_55zbMath1350.68291OpenAlexW30074706MaRDI QIDQ3104653
Masayuki Takeda, Shota Yasutake, Shuji Kijima, Kohei Hatano, Eiji Takimoto
Publication date: 16 December 2011
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2324/1524320
Related Items (7)
Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope ⋮ Bandit online optimization over the permutahedron ⋮ Decomposition Algorithm for the Single Machine Scheduling Polytope ⋮ Unnamed Item ⋮ Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types ⋮ Weighted network search games with multiple hidden objects and multiple search teams ⋮ Online Linear Optimization for Job Scheduling Under Precedence Constraints
This page was built for publication: Online Linear Optimization over Permutations