×

Found 198 Documents (Results 1–100)

Variance reduced value iteration and faster algorithms for solving Markov decision processes. (English) Zbl 1403.68386

Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 770-787 (2018).
MSC:  68W40 68W25 90C40
PDFBibTeX XMLCite
Full Text: arXiv Link

Linear and nonlinear programming. 4th ed. (English) Zbl 1319.90001

International Series in Operations Research & Management Science 228. New York, NY: Springer (ISBN 978-3-319-18841-6/hbk; 978-3-319-37439-0/pbk; 978-3-319-18842-3/ebook). xiii, 546 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI Link

The simplex method is strongly polynomial for deterministic Markov decision processes. (English) Zbl 1423.90138

Khanna, Sanjeev (ed.), Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, SODA 2013, New Orleans, LA, USA, January 6–8, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1465-1473 (2013).
MSC:  90C05 90C40 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Selected open problems in discrete geometry and optimization. (English) Zbl 1273.90114

Bezdek, Károly (ed.) et al., Discrete geometry and optimization. Selected papers based on the presentations at the conference and workshop, Toronto, Canada, September 19–23, 2011. New York, NY: Springer (ISBN 978-3-319-00199-9/hbk; 978-3-319-00200-2/ebook). Fields Institute Communications 69, 321-336 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Conditions for correct sensor network localization using SDP relaxation. (English) Zbl 1277.90095

Bezdek, Károly (ed.) et al., Discrete geometry and optimization. Selected papers based on the presentations at the conference and workshop, Toronto, Canada, September 19–23, 2011. New York, NY: Springer (ISBN 978-3-319-00199-9/hbk; 978-3-319-00200-2/ebook). Fields Institute Communications 69, 279-301 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Discrete geometry and optimization. Selected papers based on the presentations at the conference and workshop, Toronto, Canada, September 19–23, 2011. (English) Zbl 1270.52001

Fields Institute Communications 69. New York, NY: Springer (ISBN 978-3-319-00199-9/hbk; 978-3-319-00200-2/ebook). x, 336 p. (2013).
PDFBibTeX XMLCite
Full Text: DOI

Correlation robust stochastic optimization. (English) Zbl 1288.90056

Charikar, Moses (ed.), Proceedings of the 21st annual ACM-SIAM symposium on discrete algorithms, SODA 2010, Austin, TX, USA, January 17–19, 2010. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-0-89871-698-6/CD-ROM). 1087-1096 (2010).
MSC:  90C15 90C47
PDFBibTeX XMLCite

Probabilistic analysis of semidefinite relaxation detectors for multiple-input, multiple-output systems. (English) Zbl 1211.90165

Palomar, Daniel P. (ed.) et al., Convex optimization in signal processing and communications. Cambridge: Cambridge University Press (ISBN 978-0-521-76222-9/hbk). 166-191 (2010).
PDFBibTeX XMLCite

Solving min-max multi-depot vehicle routing problem. (English) Zbl 1177.90035

Pardalos, Panos M. (ed.) et al., Lectures on global optimization. Papers based on the presentations at the workshop on global optimization: methods and applications, Toronto, Canada, May 11–12, 2007. Providence, RI: American Mathematical Society (AMS); Toronto: The Fields Institute for Research in Mathematical Sciences (ISBN 978-0-8218-4485-4/hbk). Fields Institute Communications 55, 31-46 (2009).
MSC:  90B06 90B10 90C35
PDFBibTeX XMLCite

A semidefinite programming approach to tensegrity theory and realizability of graphs. (English) Zbl 1192.90137

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 766-775 (2006).
MSC:  90C22 05C62
PDFBibTeX XMLCite
Full Text: DOI

Semidefinite programming for sensor network and graph localization. (English) Zbl 1155.90438

Kurdila, Andrew J. (ed.) et al., Robust optimization-directed design. Papers based on the 1st Conference on Robust Optimization-Directed Design (RODD), Shalimar, FL, USA, April 19–21, 2004. New York, NY: Springer (ISBN 0-387-28263-7/hbk). Nonconvex Optimization and Its Applications 81, 247-275 (2006).
MSC:  90C22 90-02 90C35
PDFBibTeX XMLCite
Full Text: DOI

Stochastic combinatorial optimization with controllable risk aversion level. (Extended abstract). (English) Zbl 1155.90445

Díaz, Josep (ed.) et al., Approximation, randomization and combinatorial optimization. Algorithms and techniques. 9th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2006, and 10th international workshop on randomization and computation, RANDOM 2006, Barcelona, Spain, August 28–30, 2006. Proceedings. Berlin: Springer (ISBN 3-540-38044-2/pbk). Lecture Notes in Computer Science 4110, 224-235 (2006).
MSC:  90C27 90C15
PDFBibTeX XMLCite
Full Text: DOI

A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization. (English) Zbl 1100.90029

Hager, William W. (ed.) et al., Multiscale optimization methods and applications. Selected papers based on the presentation at the conference, Gainesville, FL, USA, February 26–28, 2004. New York, NY: Springer (ISBN 0-387-29549-6/hbk). Nonconvex Optimization and Its Applications 82, 69-84 (2006).
MSC:  90C22 90B10
PDFBibTeX XMLCite

Theory of semidefinite programming for sensor network localization. (English) Zbl 1297.90110

Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 405-414 (2005).
MSC:  90C22 05C12 68U05
PDFBibTeX XMLCite

On approximating complex quadratic optimization problems via semidefinite programming relaxations. (English) Zbl 1119.90032

Jünger, Michael (ed.) et al., Integer programming and combinatorial optimization. 11th international IPCO conference, Berlin, Germany, June 8–10, 2005. Proceedings. Berlin: Springer (ISBN 978-3-540-26199-5/pbk). Lecture Notes in Computer Science 3509, 125-135 (2005).
MSC:  90C10 90C20 90C22
PDFBibTeX XMLCite
Full Text: DOI

A multi-exchange local search algorithm for the capacitated facility location problem. (English) Zbl 1092.90525

Bienstock, Daniel (ed.) et al., Integer programming and combinatorial optimization. 10th international IPCO conference, New York, NY, USA, June 7–11, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22113-1/pbk). Lecture Notes in Computer Science 3064, 219-233 (2004).
MSC:  90B80 90B40 90C59
PDFBibTeX XMLCite
Full Text: DOI

An improved algorithm for approximating the radii of point sets. (English) Zbl 1279.68362

Arora, Sanjeev (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 6th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2003 and 7th international workshop on randomization and approximation techniques in computer science, RANDOM 2003, Princeton, NJ, USA, August 24–26, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40770-7/pbk). Lect. Notes Comput. Sci. 2764, 178-187 (2003).
PDFBibTeX XMLCite
Full Text: DOI

Linear programming and condition numbers under the real number computation model. (English) Zbl 1070.65548

Cucker, F. (ed.), Handbook of numerical analysis. Vol. XI. Special volume: Foundations of computational mathematics. Amsterdam: North-Holland (ISBN 0-444-51247-0/hbk). Handb. Numer. Anal. 11, 141-207 (2003).
PDFBibTeX XMLCite

Improved combinatorial approximation algorithms for the \(k\)-level facility location problem. (English) Zbl 1060.90677

Baeten, Jos C. M. (ed.) et al., Automata, languages and programming. 30th international colloquium, ICALP 2003, Eindhoven, The Netherland, June 30 – July 4, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40493-7/pbk). Lect. Notes Comput. Sci. 2719, 145-156 (2003).
PDFBibTeX XMLCite
Full Text: Link

Improved approximation algorithms for metric facility location problems. (English) Zbl 1013.90115

Jansen, Klaus (ed.) et al., Approximation algorithms for combinatorial optimization. 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2462, 229-242 (2002).
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software