Generating hard instances for robust combinatorial optimization
نویسندگان
چکیده
منابع مشابه
Generating Hard Satisfiable Scheduling Instances
We present a random generator of partially complete round robin timetables that produces exclusively satisfiable instances, and provide experimental evidence that there is an easy-hard-easy pattern in the computational difficulty of completing partially complete timetables as the ratio of the number of removed entries to the total number of entries of the timetable is varied. Timetables in the ...
متن کاملGenerating Hard Instances of Lattice Problems
We give a random class of lattices in Z n so that, if there is a probabilistic polynomial time algorithm which nds a short vector in a random lattice with a probability of at least 1 2 then there is also a probabilistic polynomial time algorithm which solves the following three lattice problems in every lattice in Z n with a probability exponentially close to one. (1) Find the length of a short...
متن کاملGenerating Matrix Identities and Hard Instances for Strong Proof Systems
We study the complexity of generating identities of matrix rings. We establish an unconditional lower bound on the minimal number of generators needed to generate a matrix identity, where the generators are substitution instances of elements from any given finite basis of the matrix identities. Based on our findings, we propose to consider matrix identities (and their encoding) as hard instance...
متن کاملGenerating Hard SAT/CSP Instances Using Expander Graphs
In this paper we provide a new method to generate hard k-SAT instances. We incrementally construct a high girth bipartite incidence graph of the k-SAT instance. Having high girth assures high expansion for the graph, and high expansion implies high resolution width. We have extended this approach to generate hard n-ary CSP instances and we have also adapted this idea to increase the expansion o...
متن کاملRecoverable robust combinatorial optimization problems.dvi
This paper deals with two Recoverable Robust (RR) models for combinatorial optimization problems with uncertain costs. These models were originally proposed by Büsing (2012) for the shortest path problem with uncertain costs. In this paper, we generalize the RR models to a class of combinatorial optimization problems with uncertain costs and provide new positive and negative complexity results ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2020
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2019.07.036