In a linear program (LP) in standard form, we show that the problem of finding a cheapest feasible basic vector among those containing a specified variable as a basic variable, is an NP-hard problem.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/30441/1/0000064.pd
In this paper we address the complexity of postoptimality analysis of 0/1 programs with a linear obj...
In this paper we address the complexity of postoptimality analysis of O/l programs with a linear obj...
AbstractSharir and Welzl introduced an abstract framework for optimization problems, called LP-type ...
AbstractIn a linear program (LP) in standard form, we show that the problem of finding a cheapest fe...
In a linear program (LP) in standard form, we show that the problem of finding a cheapest feasible b...
http://deepblue.lib.umich.edu/bitstream/2027.42/6738/5/bam0399.0001.001.pdfhttp://deepblue.lib.umich...
In this note, we show that linear programming and the prominent Basis Pursuit problem (i.e., minimiz...
AbstractThe complexity of linear programming and other problems in the geometry of d-dimensions is s...
We consider the problem of finding an −optimal solution of a standard linear pro-gram with real data...
We consider the problem of finding an ε{lunate}-optimal solution of a standard linear program with ...
AbstractWe describe an algorithm that first decides whether the primal-dual pair of linear programsm...
Abstract. Recent years have brought some progress in the knowledge of the complexity of linear progr...
The complexity of linear programming is discussed in the "integer" and "real number" models of compu...
In this paper we show a simple treatment of the complexity of Linear Programming. We describe the sh...
AbstractWe consider the problem of finding an ε-optimal solution of a standard linear program with r...
In this paper we address the complexity of postoptimality analysis of 0/1 programs with a linear obj...
In this paper we address the complexity of postoptimality analysis of O/l programs with a linear obj...
AbstractSharir and Welzl introduced an abstract framework for optimization problems, called LP-type ...
AbstractIn a linear program (LP) in standard form, we show that the problem of finding a cheapest fe...
In a linear program (LP) in standard form, we show that the problem of finding a cheapest feasible b...
http://deepblue.lib.umich.edu/bitstream/2027.42/6738/5/bam0399.0001.001.pdfhttp://deepblue.lib.umich...
In this note, we show that linear programming and the prominent Basis Pursuit problem (i.e., minimiz...
AbstractThe complexity of linear programming and other problems in the geometry of d-dimensions is s...
We consider the problem of finding an −optimal solution of a standard linear pro-gram with real data...
We consider the problem of finding an ε{lunate}-optimal solution of a standard linear program with ...
AbstractWe describe an algorithm that first decides whether the primal-dual pair of linear programsm...
Abstract. Recent years have brought some progress in the knowledge of the complexity of linear progr...
The complexity of linear programming is discussed in the "integer" and "real number" models of compu...
In this paper we show a simple treatment of the complexity of Linear Programming. We describe the sh...
AbstractWe consider the problem of finding an ε-optimal solution of a standard linear program with r...
In this paper we address the complexity of postoptimality analysis of 0/1 programs with a linear obj...
In this paper we address the complexity of postoptimality analysis of O/l programs with a linear obj...
AbstractSharir and Welzl introduced an abstract framework for optimization problems, called LP-type ...
DOI
Add to ORKG