scientific article; zbMATH DE number 919758

MaRDI QIDQ4890614zbMATH OpenFDO

Authors V. A. Bondarenko

Publication date 16 October 1996

zbMATH Keywords

geometric interpretationintractability of discrete optimization problemslower bounds of complexity

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The problem of intractability and analysis of heuristics in discrete optimization. I
• scientific article; zbMATH DE number 4016609
• scientific article; zbMATH DE number 3876926
• Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes
• scientific article; zbMATH DE number 3860890

Cited in

(20)

• Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems
• On polyhedron graph density in problems of combinatorial optimization
• Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization
• Studying the complexity of global verification for NP-hard discrete optimization problems
• Layered graph approaches for combinatorial optimization problems
• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• A computational complexity comparative study of graph tessellation problems
• Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes
• Polyhedral aspects of discrete optimization
• scientific article; zbMATH DE number 3876926 (Why is no real title available?)
• scientific article; zbMATH DE number 4158391 (Why is no real title available?)
• scientific article; zbMATH DE number 3828715 (Why is no real title available?)
• scientific article; zbMATH DE number 4108497 (Why is no real title available?)
• scientific article; zbMATH DE number 176878 (Why is no real title available?)
• scientific article; zbMATH DE number 702972 (Why is no real title available?)
• Polyhedral study of the connected subgraph problem
• Polyhedral techniques in combinatorial optimization I: Theory
• scientific article; zbMATH DE number 862208 (Why is no real title available?)
• The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes
• On the usefulness of accessibility graphs with combinatorial optimization problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4890614)