ISBN: 9781332274277 - the parsimonious property of cut covering problems and its applications (classic reprint): january, 1994: january, 1994 (classic reprint) (4 risultati)

Perfeziona la tua ricerca

  • Libri (4)

a

Fascia di prezzo personalizzata (EUR)

a

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1332274277 / 9781332274277

    • Brossura

    Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 25,12

     Spedizione gratuita 
    Spedito in U.S.A.

    Quantità: 15 disponibili

    PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1332274277 / 9781332274277

    • Brossura

    Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 24,81

    EUR 3,92 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 15 disponibili

    PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

  • Altre immagini

    Lingua: Inglese

    Editore: Forgotten Books, 2018

    1332274277 / 9781332274277

    • Brossura
    • Print on Demand

    Da: Forgotten Books, London, Regno UnitoForgotten Books

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 15,79

     Spedizione gratuita 
    Spedito da Regno Unito a U.S.A.

    Quantità: Più di 20 disponibili

    Paperback. Condizione: New. Print on Demand. This book provides an in-depth analysis of the "parsimonious" property of cut covering problems, a class of combinatorial challenges that encompass well-known issues like the Steiner tree and traveling salesman conundrums. The author initially presents a set of conditions that, when met by a set function, will guarantee the parsimonious property. This property implies that degree constraints in the linear programming relaxation of cut covering problems can be omitted without affecting the optimal solution, an observation that has spurred significant advancements in the field. The author continues by examining various implications of this property, including monotonicity properties of the linear programming relaxation and the integrality of polyhedra associated with these problems. In doing so, this book unifies and expands upon several previously independent results, revealing the underlying connections between them. Additionally, the author proposes new methods for analyzing the worst-case performance of approximation algorithms for cut covering problems and introduces a novel approximation algorithm that is simpler to implement than existing methods. This book provides a comprehensive understanding of the parsimonious property and its significance in addressing cut covering problems, offering valuable insights for researchers and practitioners working in combinatorial optimization and related areas. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…

  • Lingua: Inglese

    Editore: Forgotten Books, 2015

    1332274277 / 9781332274277

    • Brossura

    Da: Buchpark, Trebbin, GermaniaBuchpark

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Usato - Ottimo

    EUR 16,00

    EUR 105,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibile

    Condizione: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.