<--- Back to Details
First PageDocument Content
Operations research / Linear programming / Combinatorial optimization / Convex optimization / Polyhedral combinatorics / Unimodular matrix / Ellipsoid method / Cutting-plane method / Relaxation / Mathematics / Mathematical optimization / Theoretical computer science
Date: 1998-12-14 07:36:11
Operations research
Linear programming
Combinatorial optimization
Convex optimization
Polyhedral combinatorics
Unimodular matrix
Ellipsoid method
Cutting-plane method
Relaxation
Mathematics
Mathematical optimization
Theoretical computer science

Add to Reading List

Source URL: www.cs.uu.nl

Download Document from Source Website

File Size: 164,00 KB

Share Document on Facebook

Similar Documents

Mathematics / Mathematical optimization / Operations research / Computational complexity theory / Linear programming / Convex optimization / Complexity classes / Combinatorial optimization / Ellipsoid method / Leonid Khachiyan / Simplex algorithm / Ellipsoid

The Ellipsoid Method: A Survey

DocID: 1rsIC - View Document

Mathematical optimization / Numerical analysis / Mathematical analysis / Operations research / Linear programming / Convex optimization / Convex analysis / Ellipsoid method / Feasible region / Convex function / Linear inequality / Candidate solution

CS168: The Modern Algorithmic Toolbox Lecture #18: Linear and Convex Programming, with Applications to Sparse Recovery Tim Roughgarden & Gregory Valiant∗ May 25, 2016

DocID: 1rjsj - View Document

Mathematical optimization / Convex optimization / Operations research / Mathematical analysis / Linear programming / Ellipsoid method / Relaxation / Duality

CS261: Exercise Set #5 For the week of February 1–5, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

DocID: 1qXY7 - View Document

Mathematical optimization / Mathematics / Operations research / Linear programming / Convex optimization / Combinatorial optimization / Computational complexity theory / Submodular set function / Randomized rounding / Optimization problem / Matroid / Ellipsoid method

From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡

DocID: 1qR3A - View Document

Computational phylogenetics / Mathematical optimization / Operations research / Mathematics / Linear programming / Bioinformatics / Convex optimization / Sequence alignment / SmithWaterman algorithm / Ellipsoid method / Linear inequality / Inequality

Simple and Fast Inverse Alignment John Kececioglu and Eagu Kim Department of Computer Science, The University of Arizona, Tucson, AZ 85721, USA {kece, egkim}@cs.arizona.edu

DocID: 1qOVn - View Document