Amanote Research

Amanote Research

    RegisterSign In

Analysis of LP Relaxations for Multiway and Multicut Problems

Networks - United States
doi 10.1002/(sici)1097-0037(199909)34:2<102::aid-net3>3.0.co;2-x
Full Text
Open PDF
Abstract

Available in full text

Categories
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
Date

September 1, 1999

Authors
Dimitris BertsimasChung-Piaw TeoRakesh Vohra
Publisher

Wiley-Blackwell


Related search

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

2017English

Semidefinite Relaxations of Ordering Problems

Mathematical Programming, Series B
MathematicsSoftware
2013English

Multiway Frequency Analysis for Experimental Psychologists.

Canadian Journal of Experimental Psychology
MedicineExperimentalCognitive Psychology
2003English

Solving Commutative Relaxations of Word Problems

2007English

Algebraic Duality Theorems for Infinite LP Problems

Linear Algebra and Its Applications
Numerical AnalysisAlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTopology
2011English

The Domination Heuristic for LP-type Problems

2009English

Convex Relaxations for Consensus and Non-Minimal Problems in 3D Vision

2019English

Convex Relaxations and Approximations of Chance-Constrained AC-OPF Problems

IEEE Transactions on Power Systems
Electronic EngineeringPower TechnologyElectricalEnergy Engineering
2019English

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