Search Sciweavers | Sciweavers

We consider the problem minX{0,1}n {c x : aj x bj , j = 1, . . . , m}, where the aj are random vectors with unknown distributions. The only information we are given regarding the ...

Michael R. Wagner

claim paper

Read More »

click to vote

IEEEMM
2007

70views more IEEEMM 2007»

Recognizing Posture in Pictures with Successive Convexification and Linear Programming

15 years 3 months ago

Download www.cs.sfu.ca

Hao Jiang, Ze-Nian Li, Mark S. Drew

claim paper

Read More »

click to vote

RC
2006

50views more RC 2006»

Computational Experience with Rigorous Error Bounds for the Netlib Linear Programming Library

15 years 3 months ago

Download www.ti3.tu-harburg.de

Christian Keil, Christian Jansson

claim paper

Read More »

click to vote

INFORMS
2007

36views more INFORMS 2007»

Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability

15 years 3 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers