Muutke küpsiste eelistusi

E-raamat: Integer Programming and Combinatorial Optimization: 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings

Edited by , Edited by
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 92,01 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Integer Programming and Combinatorial Optimization: 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, ProceedingsSuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book constitutes the refereed proceedings of the 23rd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2022, held in Eindhoven, The Netherlands, in June 2022. The 33 full papers presented were carefully reviewed and selected from 93 submissions addressing key techniques of document analysis. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting the latest results of theory and practice of the various aspects of discrete optimization.
Total dual dyadicness and dyadic generating sets.- Faster Goal-Oriented
Shortest Path Search for Bulk and Incremental Detailed Routing.- On the
maximal number of columns of a -modular matrix.- A Simple LP-Based
Approximation Algorithm for the Matching Augmentation Problem.- aster
Connectivity in Low-rank Hypergraphs via Expander Decomposition.- Improving
the Cook et al. Proximity Bound Given Integral Valued Constraints.- Sparse
Multi-Term Disjunctive Cuts for the Epigraph of a Function of Binary
Variables.- A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem
in FPT Time.- Optimal item pricing in online combinatorial auctions.- On
Circuit Diameter Bounds via Circuit Imbalances.- A Simple Method for Convex
Optimization in the Oracle Model.- On the Complexity of Separation From the
Knapsack Polytope.- Simple odd -cycle inequalities for binary polynomial
optimization.- Combinatorial algorithms for rooted prize-collecting walks and
applications to orienteering and minimum-latency problems.- Intersecting and
dense restrictions of clutters in polynomial time.- LP-based Approximations
for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization.-
Generalized Malleable Scheduling under Concave Processing Speeds.- Improved
Approximations for Capacitated Vehicle Routing with Unsplittable Client
Demands.- SOCP-based disjunctive cuts for a class of integer nonlinear
bilevel programs.- Non-Adaptive Stochastic Score Classification and
Explainable Halfspace Evaluation.- On the Complexity of Finding Shortest
Variable Disjunction Branch-and-Bound Proofs.- Matroid-Based TSP Rounding for
Half-Integral Solutions.- The Two-Stripe Symmetric Circulant TSP is in P.-
Jin and David Williamson An Abstract Model for Branch-and-Cut.- Neural
networks with linear threshold activations: structure and algorithms.- A PTAS
for the Horizontal Rectangle Stabbing Problem.- Lattice-free simplices with
lattice width 2d - o(d) .- Graph Coloring and Semidefinite Rank.- .A
Competitive Algorithm for Throughput Maximization on Identical Machines.- The
Limits of Local Search for Weighted k-Set Packing.- The Secretary Problem
with Distributions.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97830310690172e.html
Märksõnad: