Exact Algorithms for NP-Hard Problems: A Survey

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-36478-1_17
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Reoptimization of NP-Hard Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Exact Algorithms for Dominating Clique Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

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

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

Exact Algorithms for Different Classes of Vehicle Routing Problems

4OR
MathematicsManagement ScienceManagement Information SystemsComputational TheoryOperations ResearchTheoretical Computer Science
2012English

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2011English

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

2017English

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

INFOR
Signal ProcessingComputer Science ApplicationsInformation Systems
2015English

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

International Journal of Computer & Software Engineering
2018English

Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy