On the path-width of integer linear programming
DOI10.1016/J.IC.2016.07.010zbMATH Open1362.68230OpenAlexW2089047607MaRDI QIDQ515665FDOQ515665
Authors: Constantin Enea, Peter Habermehl, Omar Inverso, Gennaro Parlato 
Publication date: 16 March 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/386737/1/final.pdf
Recommendations
- On the path-width of integer linear programming
- scientific article; zbMATH DE number 2010046
- On Integer Programming and the Branch-Width of the Constraint Matrix
- Complexity of linear relaxations in integer programming
- scientific article; zbMATH DE number 3847219
- A linear algorithm for integer programming in the plane
- On the integer max-linear programming problem
- scientific article; zbMATH DE number 3511865
- scientific article
- Integer Linear Programs and Local Search for Max-Cut
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Integer programming (90C10) Decidability of theories and sets of sentences (03B25)
Cites Work
- An Automatic Method of Solving Discrete Programming Problems
- Factoring polynomials with rational coefficients
- Parametrized complexity theory.
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Title not available (Why is that?)
- On Context-Free Languages
- Adding nesting structure to words
- Weak Second‐Order Arithmetic and Finite Automata
- On the complexity of integer programming
- Model-checking of ordered multi-pushdown automata
- A Unifying Approach for Multistack Pushdown Automata
- Reachability of multistack pushdown systems with scope-bounded matching relations
- Context-Bounded Analysis of Concurrent Queue Systems
- Scope-Bounded Pushdown Languages
- Reachability analysis of communicating pushdown systems
- Tools and Algorithms for the Construction and Analysis of Systems
- The structure of the models of decidable monadic theories of graphs
- Title not available (Why is that?)
- The tree width of auxiliary storage
- Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
- Linear-time model-checking for multithreaded programs under scope-bounding
- A Temporal Logic for Multi-threaded Programs
- A Perfect Model for Bounded Verification
- Title not available (Why is that?)
- Scope-bounded pushdown languages
This page was built for publication: On the path-width of integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515665)
