Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,214,349 papers from all fields of science
Search
Sign In
Create Free Account
Randomized rounding
Within computer science and operations research,many combinatorial optimization problems are computationally intractable to solve exactly (to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Algorithm
Analysis of algorithms
Approximation algorithm
Combinatorial optimization
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Inferring disease causing genes and their pathways: A mathematical perspective
Jeethu V. Devasia
,
P. Chandran
arXiv.org
2016
Corpus ID: 1982175
A system level view of cellular processes for human and several organisms can be cap- tured by analyzing molecular interaction…
Expand
2015
2015
A Practical Key Exchange for the Internet using Lattice Cryptography
Vikram Singh
IACR Cryptology ePrint Archive
2015
Corpus ID: 15200612
In [21], Peikert presents an efficient and provably secure set of lower level primitives for practical post-quantum cryptography…
Expand
2012
2012
An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
Tao Wu
,
Leyuan Shi
,
Jie Song
Annals of Operations Research
2012
Corpus ID: 15686967
This paper considers the capacitated multi-level lot-sizing problem with setup times, a class of difficult problems often faced…
Expand
2010
2010
Applying a Modified Particle Swarm Optimizer to Discrete Truss Topology Optimization
Bin Yang
,
Qilin Zhang
International Conference on Computational…
2010
Corpus ID: 18043491
Particle Swarm Optimization (PSO) is a new paradigm of Swarm Intelligence which proposes that the co-operation of individuals…
Expand
2009
2009
Randomized Rounding in the Presence of a Cardinality Constraint
Benjamin Doerr
,
Magnus Wahlström
Workshop on Algorithm Engineering and…
2009
Corpus ID: 15262384
We consider the problem of generating randomized roundings that satisfy a single cardinality constraint and admit Chernoff-type…
Expand
2007
2007
An Ant Colony System Hybridized with Randomized Algorithm for TSP
Chengming Qi
Software Engineering, Artificial Intelligence…
2007
Corpus ID: 1696427
Ant algorithms are a recently developed, population- based approach which has been successfully applied to several NP-hard…
Expand
2006
2006
Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks
Masaru Iwasa
,
Hiroo Saito
,
Tomomi Matsui
Electron. Notes Discret. Math.
2006
Corpus ID: 6060510
2003
2003
Association Mining in Gradually Changing Domains
A. Rozsypal
,
M. Kubát
The Florida AI Research Society
2003
Corpus ID: 14495499
Association mining explores algorithms capable of detecting frequently co-occurring items in transactions. A transaction can be…
Expand
1986
1986
Randomized Rounding And Discrete Ham-Sandwich Theorems:
P. Raghavan
1986
Corpus ID: 124912926
This thesis deals with the approximate solution of a class of zero-one integer programs arising in the design of integrated…
Expand
1955
1955
The Solution of Linear Simultaneous Equations by Matrix Iteration
J. Guest
1955
Corpus ID: 119979968
In a recent paper Stiefel presented a method designed for a high speed computer, for solving simultaneous linear algebraic…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE