Restless bandits with switching costs: linear programming relaxations, performance bounds and limited lookahead policies

2006 American Control Conference ◽

10.1109/acc.2006.1656445 ◽

2006 ◽

Author(s):

J. Le Ny ◽

E. Feron

Keyword(s):

Linear Programming ◽

Switching Costs ◽

Performance Bounds ◽

Restless Bandits ◽

Linear Programming Relaxations

Download Full-text

Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic

Operations Research ◽

10.1287/opre.48.1.80.12444 ◽

2000 ◽

Vol 48 (1) ◽

pp. 80-90 ◽

Author(s):

Dimitris Bertsimas ◽

José Niño-Mora

Keyword(s):

Linear Programming ◽

Restless Bandits ◽

Linear Programming Relaxations ◽

Download Full-text

Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38527-8_1 ◽

2013 ◽

pp. 1-3 ◽

Author(s):

Martin Skutella

Keyword(s):

Linear Programming ◽

Parallel Machines ◽

Unrelated Parallel Machines ◽

Linear Programming Relaxations

Download Full-text

Stronger linear programming relaxations of max-cut

Mathematical Programming ◽

10.1007/s10107-003-0423-5 ◽

2003 ◽

Vol 97 (3) ◽

pp. 451-469 ◽

Author(s):

David Avis ◽

Jun Umemoto

Keyword(s):

Linear Programming ◽

Linear Programming Relaxations

Download Full-text

Tight linear programming relaxations of uncapacitated p-hub median problems

European Journal of Operational Research ◽

10.1016/0377-2217(95)00100-x ◽

1996 ◽

Vol 94 (3) ◽

pp. 582-593 ◽

Author(s):

Darko Skorin-Kapov ◽

Jadranka Skorin-Kapov ◽

Morton O'Kelly

Keyword(s):

Linear Programming ◽

Linear Programming Relaxations ◽

Tight Linear Programming Relaxations ◽

Median Problems

Download Full-text

Equivalence of two linear programming relaxations for broadcast scheduling

Operations Research Letters ◽

10.1016/j.orl.2003.11.012 ◽

2004 ◽

Vol 32 (5) ◽

pp. 473-478 ◽

Author(s):

Samir Khuller ◽

Yoo-Ah Kim

Keyword(s):

Linear Programming ◽

Broadcast Scheduling ◽

Linear Programming Relaxations

Download Full-text

Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2017.34 ◽

2017 ◽

Author(s):

Shi Li

Keyword(s):

Linear Programming ◽

Completion Time ◽

Total Weighted Completion Time ◽

Linear Programming Relaxations ◽

Weighted Completion Time

Download Full-text

On linear programming relaxations for solving polynomial programming problems

Computers & Operations Research ◽

10.1016/j.cor.2018.06.010 ◽

2018 ◽

Vol 99 ◽

pp. 67-77 ◽

Author(s):

Evrim Dalkiran ◽

Laleh Ghalami

Keyword(s):

Linear Programming ◽

Polynomial Programming ◽

Linear Programming Relaxations

Download Full-text

Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations

Automated Technology for Verification and Analysis - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33386-6_12 ◽

2012 ◽

pp. 137-151 ◽

Author(s):

Mohamed Amin Ben Sassi ◽

Romain Testylier ◽

Thao Dang ◽

Antoine Girard

Keyword(s):

Linear Programming ◽

Polynomial Systems ◽

Reachability Analysis ◽

Linear Programming Relaxations

Download Full-text

Linear programming relaxations of a network flow problem with applications in machinery industry

2012 IEEE Aerospace Conference ◽

10.1109/aero.2012.6187325 ◽

2012 ◽

Author(s):

A. Ghahari

Keyword(s):

Linear Programming ◽

Network Flow ◽

Flow Problem ◽

Network Flow Problem ◽

Machinery Industry ◽

Linear Programming Relaxations

Download Full-text

Survivable networks, linear programming relaxations and the parsimonious property

Mathematical Programming ◽

10.1007/bf01580607 ◽

1993 ◽

Vol 60 (1-3) ◽

pp. 145-166 ◽

Author(s):

Michel X. Goemans ◽

Dimitris J. Bertsimas

Keyword(s):

Linear Programming ◽

Survivable Networks ◽

Linear Programming Relaxations

Download Full-text