JPEG compression history estimation for color images (2008)
Ramesh (neelsh Neelamani, Ricardo De Queiroz, Zhigang Fan, Senior Member, Senior Member, Sanjeeb Dash, ...
Abstract—We routinely encounter digital color images that were previously compressed using the Joint Photographic Experts Group (JPEG) standard. En route to the image’s current representation,...
ON NEARLY ORTHOGONAL LATTICE BASES AND RANDOM LATTICES ∗ (2008)
Ramesh Neelamani, Sanjeeb Dash, G. Baraniuk
Abstract. We study lattice bases where the angle between any basis vector and the linear subspace spanned by the other basis vectors is at least π radians; we denote such bases as “nearly 3...
Priatrd in V.S^, ON THE MATRIX-CUT RANK OF POLYHEDRA (2008)
Lov^sz and Schrijver (1991) described a semidcfinile operator for generating strong valid inequalities for the 0-! vectors in a prescribed polyhedron. Among their resuli.s. they showed ihai ii...
JPEG compression history estimation for color images (2008)
Ramesh Neelamani, Ricardo De Queiroz, Zhigang Fan, Sanjeeb Dash, Richard G. Baraniuk
Accepted by the IEEE Transactions on Image Processing We routinely encounter digital color images that were previously JPEG-compressed. En-route to the image’s current representation, the previous...
We use a branch-and-cut search to solve the Whizzkids'96 vehicle routing problem, demonstrating that the winning solution in the 1996 competition is in fact optimal. Our algorithmic framework...
Exact solutions to linear programming problems (2007)
William Cook, Sanjeeb Dash, Daniel G. Espinoza
The use of floating-point calculations limits the accuracy of solutions obtained by standard LP software. We present a simplex-based algorithm that returns exact rational solutions, taking advantage...
Projected Chvátal-Gomory cuts for Mixed Integer Linear Programs (2006)
Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi
Recent experiments by Fischetti and Lodi show that the first Chvátal closure of a pure Integer Linear Program (ILP) often gives a surprisingly tight approximation of the integer hull. They optimize...
O.: On the strength of gomory mixed-integer cuts as group cuts (2006)
Gomory mixed-integer (GMI) cuts generated from optimal simplex tableaus are known to be useful in solving mixed-integer programs. Further, it is well-known that GMI cuts can be derived from facets of...
Solution of a min-max vehicle routing problem (2002)
William Cook, Sanjeeb Dash, André Rohe
We use a branch-and-cut search to solve the Whizzkids’96 vehicle routing problem, demonstrating that the winning solution in the 1996 competition is in fact optimal. Our algorithmic framework...
On the matrix cuts of Lovasz and Schrijver and their use in integer programming (2001)
An important approach to solving many discrete optimization problems is to associate the discrete set (over which we wish to optimize) with the 0-1 vectors in a given polyhedron and to derive linear...
On the matrix-cut rank of polyhedra (2001)
Lov'asz and Schrijver (1991) described a semi-definite operator for generating strong valid inequalities for the 0-1 vectors in a prescribed polyhedron. Among their results, they showed that n...
On the Matrix-Cut Rank of Polyhedra (2001)
William Cook And, William Cook, Sanjeeb Dash
Lov'asz and Schrijver (1991) described a semi-definite operator for generating strong valid inequalities for the 0-1 vectors in a prescribed polyhedron. Among their results, they showed that n...
On the Matrix-Cut Rank of Polyhedra (1999)
Lov'asz and Schrijver (1991) described a semi-definite operator for generating strong valid inequalities for the 0-1 vectors in a prescribed polyhedron. Among their results, they showed that n...