Parameterized Complexity of Cardinality Constrained Optimization Problems

Computer Journal - United Kingdom
doi 10.1093/comjnl/bxm086
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Oxford University Press (OUP)

Related search

A Short Note on the Robust Combinatorial Optimization Problems With Cardinality Constrained Uncertainty

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

On the Space Complexity of Parameterized Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Parameterized Complexity of Generalized Vertex Cover Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

On Miniaturized Problems in Parameterized Complexity Theory

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2006English

Solving Complex Cardinality Constrained Mean-Variance Portfolio Optimization Problems Using Hybrid HS and TLBO Algorithm

ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH
2018English

Scaling of Constrained Optimization Problems.

Doboku Gakkai Ronbunshu
1985English

Parameterized Proof Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2011English

Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Neural Networks for Constrained Optimization Problems

International Journal of Circuit Theory and Applications
Electronic EngineeringOpticalApplied MathematicsComputer Science ApplicationsElectricalMagnetic MaterialsElectronic
1993English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy