LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP

doi 10.1137/1.9781611974782.89
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems

INFOR
Signal ProcessingComputer Science ApplicationsInformation Systems
2015English

Reoptimization of NP-Hard Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Analysis of LP Relaxations for Multiway and Multicut Problems

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
1999English

Generating Highly Balanced Sudoku Problems as Hard Problems

Journal of Heuristics
ControlInformation SystemsManagement ScienceComputer NetworksCommunicationsOptimizationOperations ResearchArtificial IntelligenceSoftware
2010English

Exact Algorithms for NP-Hard Problems: A Survey

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Some Hard Families of Parameterized Counting Problems

ACM Transactions on Computation Theory
Computational TheoryTheoretical Computer ScienceMathematics
2015English

Automating Resolution Is NP-Hard

2019English

Manufacturing Production Line Modelling and Classification of Associated NP-Hard Problems

International Journal of Computer & Software Engineering
2018English

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy