On the path-width of integer linear programming
type: Item
instance of: scholarly article
title: On the path-width of integer linear programming
zbMATH Open document ID: 1362.68230
author: Constantin Enea
author: Peter Habermehl
author: Omar Inverso
author: Gennaro Parlato
published in: Information and Computation
publication date: 2017-03-16T00:00:00Z
full work available at URL: final.pdf
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6695642
zbMATH Keywords: integer linear programming
zbMATH Keywords: bounded path-width
zbMATH Keywords: first-order logic on graphs
zbMATH Keywords: automata
MaRDI profile type: Publication
OpenAlex ID: W2089047607
cites work: Adding nesting structure to words
cites work: The tree width of auxiliary storage
cites work: Q4291429
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: The structure of the models of decidable monadic theories of graphs
cites work: Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding
cites work: Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
cites work: A Temporal Logic for Multi-threaded Programs
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: Model-checking of ordered multi-pushdown automata
cites work: Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations
cites work: Scope-Bounded Pushdown Languages
cites work: Scope-bounded pushdown languages
cites work: A Unifying Approach for Multistack Pushdown Automata
cites work: Context-Bounded Analysis of Concurrent Queue Systems
cites work: Reachability Analysis of Communicating Pushdown Systems
cites work: On Context-Free Languages
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: Factoring polynomials with rational coefficients
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Q4427903
cites work: On the complexity of integer programming
cites work: Q4995360
cites work: Parametrized complexity theory.
cites work: A Perfect Model for Bounded Verification
DOI: 10.1016/J.IC.2016.07.010
Recommended article: Q4995360
Recommended article: Q4434987
Recommended article: On Integer Programming and the Branch-Width of the Constraint Matrix
Recommended article: Complexity of linear relaxations in integer programming
Recommended article: Q3316962
Recommended article: A linear algorithm for integer programming in the plane
Recommended article: On the integer max-linear programming problem
Recommended article: Q4091715
Recommended article: Q3358528
Recommended article: Integer Linear Programs and Local Search for Max-Cut
description: scientific article; zbMATH DE number 6695642