On the decidability of finding a positive ILP-instance in a regular set of ILP-instances

DOI10.1007/s00236-022-00429-xOpenAlexW4289793427MaRDI QIDQ5918790

Petra Wolf

Publication date: 30 August 2022

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-022-00429-x

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• lp_solve
• CPLEX
• Gurobi
• Optimization Toolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regular realizability problems for context-free languages
• On regular realizability problems
• A survey of graph edit distance
• Detecting palindromes, patterns and borders in regular languages
• Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy
• The complexity landscape of decompositional parameters for ILP
• From decidability to undecidability by considering regular sets of instances
• Automata equipped with auxiliary data structures and regular realizability problems
• On expressive power of regular realizability problems
• The string edit distance matching problem with moves
• Orbits of Linear Maps and Regular Languages
• On Models of a Nondeterministic Computation
• 50 Years of Integer Programming 1958-2008
• The String-to-String Correction Problem
• Reducibility among Combinatorial Problems
• Regular Realizability Problems and Context-Free Languages
• The complexity of theorem-proving procedures
• Properties of graphs specified by a regular language
• On the decidability of finding a positive ILP-instance in a regular set of ILP-instances