Sciweavers

368 search results - page 54 / 74
» Sphere Methods for LP
Sort
View
115
Voted
COR
2008
99views more  COR 2008»
15 years 2 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
ANOR
2006
133views more  ANOR 2006»
15 years 1 months ago
An integrated model for logistics network design
In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. Our formulation is flexi...
Jean-François Cordeau, Federico Pasin, Mari...
COR
2006
99views more  COR 2006»
15 years 1 months ago
Artificial neural networks and multicriterion analysis for sustainable irrigation planning
The objective of the present paper is to select the best compromise irrigation planning strategy for the case study of Jayakwadi irrigation project, Maharashtra, India. Four-phase...
K. Srinivasa Raju, D. Nagesh Kumar, Lucien Duckste...
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 1 months ago
Searching for low weight pseudo-codewords
— Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach...
Michael Chertkov, Mikhail G. Stepanov
DAC
2010
ACM
14 years 12 months ago
Non-uniform clock mesh optimization with linear programming buffer insertion
Clock meshes are extremely effective at filtering clock skew from environmental and process variations. For this reason, clock meshes are used in most high performance designs. Ho...
Matthew R. Guthaus, Gustavo Wilke, Ricardo Reis