Amanote Research

Amanote Research

    RegisterSign In

The Domination Heuristic for LP-type Problems

doi 10.1137/1.9781611972894.8
Full Text
Open PDF
Abstract

Available in full text

Date

January 3, 2009

Authors
Taras GalkovskyiBernd GärtnerBogdan Rublev
Publisher

Society for Industrial and Applied Mathematics


Related search

Extremal Problems for Roman Domination

SIAM Journal on Discrete Mathematics
Mathematics
2009English

An LP-based Heuristic Algorithm for the Node Capacitated In-Tree Packing Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2012English

Algebraic Duality Theorems for Infinite LP Problems

Linear Algebra and Its Applications
Numerical AnalysisAlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTopology
2011English

Locating Binding Constraints in LP Problems

American Journal of Operations Research
2019English

Analysis of LP Relaxations for Multiway and Multicut Problems

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
1999English

Solving LP Problems via Weighted Centers

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
1996English

Some Heuristic Problems of the Modern Oncology

Clinical Practice
MedicinePharmacology
2019English

Heuristic and Special Case Algorithms for Dispersion Problems

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1994English

Fast LP-based Approximations for Geometric Packing and Covering Problems

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy