LP-type problem

Results: 20



#Item
1Unique Sink Orientations of Grids  ? Bernd G¨artner1 , Walter D. Morris, Jr.2 , and Leo R¨ ust3

Unique Sink Orientations of Grids ? Bernd G¨artner1 , Walter D. Morris, Jr.2 , and Leo R¨ ust3

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-06-20 11:55:09
2BRICS  Basic Research in Computer Science BRICS NS-00-1 B. G¨artner: Randomization and Abstraction — Useful Tools for Optimization

BRICS Basic Research in Computer Science BRICS NS-00-1 B. G¨artner: Randomization and Abstraction — Useful Tools for Optimization

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-06-20 11:55:09
350  LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl

50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-07-12 11:32:46
450  LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl

50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-07-12 11:32:46
5A subexponential lower bound for the Random Facet algorithm for Parity Games Oliver Friedmann∗ Thomas Dueholm Hansen†

A subexponential lower bound for the Random Facet algorithm for Parity Games Oliver Friedmann∗ Thomas Dueholm Hansen†

Add to Reading List

Source URL: files.oliverfriedmann.de

Language: English - Date: 2012-02-10 07:43:15
6Subexponential lower bounds for randomized pivoting rules for solving linear programs Oliver Friedmann ∗

Subexponential lower bounds for randomized pivoting rules for solving linear programs Oliver Friedmann ∗

Add to Reading List

Source URL: files.oliverfriedmann.de

Language: English - Date: 2012-02-10 07:43:14
7Solving online feasibility problem in constant amortized time per update Lilian Buzer∗† global shape of the pixels by minimizing an approximation error. But, using digital primitives we can build an exact approximati

Solving online feasibility problem in constant amortized time per update Lilian Buzer∗† global shape of the pixels by minimizing an approximation error. But, using digital primitives we can build an exact approximati

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:46
8CCCG 2006, Kingston, Ontario, August 14–16, 2006  A Simple Streaming Algorithm for Minimum Enclosing Balls Hamid Zarrabi-Zadeh∗  Abstract

CCCG 2006, Kingston, Ontario, August 14–16, 2006 A Simple Streaming Algorithm for Minimum Enclosing Balls Hamid Zarrabi-Zadeh∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-27 22:59:03
9Science / Multi-objective optimization / Genetic algorithm / Interpolation / Algorithm / Heuristic function / Bilevel program / LP-type problem / Trajectory optimization / Mathematical optimization / Applied mathematics / Mathematics

A genetic algorithm for solving a class of multi-objective bilevel programming problems Shanfeng Zhang & Keqiang Li Department of Computer, ****** University, Guangzhou, 810008, China Abstract

Add to Reading List

Source URL: icaesee.org

Language: English
10Faster Construction of Planar Two-centers David Eppstein∗ Abstract  tical implementation. The method is complicated, and

Faster Construction of Planar Two-centers David Eppstein∗ Abstract tical implementation. The method is complicated, and

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 1997-12-08 20:38:05