|Listed in category:
Have one to sell?

Graphs and Combinatorial Optimization: from Theory to Applications: CTW2020 Proc

Condition:
Brand New
3 available
Price:
US $66.42
ApproximatelyRM 311.34
Postage:
Free Economy Shipping. See detailsfor shipping
Located in: Fairfield, Ohio, United States
Delivery:
Estimated between Tue, 4 Jun and Fri, 14 Jun to 43230
Estimated delivery dates - opens in a new window or tab include seller's handling time, origin ZIP Code, destination ZIP Code and time of acceptance and will depend on shipping service selected and receipt of cleared paymentcleared payment - opens in a new window or tab. Delivery times may vary, especially during peak periods.
Returns:
30 days return. Buyer pays for return shipping. See details- for more information about returns
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)

Shop with confidence

eBay Premium Service
Trusted seller, fast shipping, and easy returns. 

Seller information

Registered as a Business Seller
Seller assumes all responsibility for this listing.
eBay item number:364701023800
Last updated on May 19, 2024 20:33:04 MYTView all revisionsView all revisions

Item specifics

Condition
Brand New: A new, unread, unused book in perfect condition with no missing or damaged pages. See all condition definitionsopens in a new window or tab
ISBN-13
9783030630744
Book Title
Graphs and Combinatorial Optimization: from Theory to Application
ISBN
9783030630744
Publication Year
2022
Series
Airo Springer Ser.
Type
Textbook
Format
Trade Paperback
Language
English
Publication Name
Graphs and Combinatorial Optimization: from Theory to Applications : Ctw2020 Proceedings
Author
Giuseppe Stecca
Item Length
9.3in
Publisher
Springer International Publishing A&G
Item Width
6.1in
Item Weight
23 Oz
Number of Pages
Xiii, 413 Pages

About this product

Product Information

This book highlights new and original contributions on Graph Theory and Combinatorial Optimization both from the theoretical point of view and from applications in all fields. The book chapters describe models and methods based on graphs, structural properties, discrete optimization, network optimization, mixed-integer programming, heuristics, meta-heuristics, math-heuristics, and exact methods as well as applications. The book collects selected contributions from the CTW2020 international conference (18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization), held online on September 14-16, 2020. The conference was organized by IASI-CNR with the contribution of University of Roma Tre, University Roma Tor Vergata, and CNRS-LIX and with the support of AIRO. It is addressed to researchers, PhD students, and practitioners in the fields of Graph Theory, Discrete Mathematics, Combinatorial Optimization, and Operations Research.

Product Identifiers

Publisher
Springer International Publishing A&G
ISBN-10
3030630749
ISBN-13
9783030630744
eBay Product ID (ePID)
16057281237

Product Key Features

Author
Giuseppe Stecca
Publication Name
Graphs and Combinatorial Optimization: from Theory to Applications : Ctw2020 Proceedings
Format
Trade Paperback
Language
English
Publication Year
2022
Series
Airo Springer Ser.
Type
Textbook
Number of Pages
Xiii, 413 Pages

Dimensions

Item Length
9.3in
Item Width
6.1in
Item Weight
23 Oz

Additional Product Features

Series Volume Number
5
Number of Volumes
1 Vol.
Lc Classification Number
Qa402.5-402.6
Table of Content
W. Hochstattler and J. Wiehe, The Chromatic Polynomial of a Digraph.- J. Dìaz et al., On List k-Coloring Convex Bipartite Graphs.- E. Kubicka et al., Total chromatic sum for trees.- S. Ghosal and S. C. Ghosh, An incremental search heuristic for coloring vertices of a graph.- S. Bandopadhyay et al., Improved Bounds on the Span of L (1,2)-edge Labeling of Some InFinite Regular Grids.- E. Althaus and S. Ziegler, Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm.- H. Kerivin and A. Wagler, On superperfection of edge intersection graphs of paths.- L. Liberti et al., A cycle-based formulation for the Distance Geometry Problem.- P. Samer and D. Haugland, The unsuitable neighbourhood inequalities for the Fixed cardinality stable set polytope.- Lucas L. S. Portugal et al., Relating hypergraph parameters of generalized power graphs.- A. Nixon, Assur decompositions of direction-length frameworks.- M. Hiller et al., On the Burning Number of p-Caterpillars.- J. Boeckmann and C. Thielen, An Approximation Algorithm for Network Flow Interdiction with Unit Costs and Two Capacities.- T. Bacci and S. Nicoloso, On the benchmark instances for the Bin Packing Problem with Conicts.- Barbara M. Anthony and Alison M. Marr, Directed Zagreb Indices.- F. Couto et al., Edge Tree Spanners.- S. Khalife, Sequence graphs: characterization and counting of admissible elements.- L. Burahem Martins et al., On solving the time window assignment vehicle routing problem via iterated local search.- M. Barbato et al., Synchronized Pickup and Delivery Problems with Connecting FIFO Stack.- A. Teymourifar et al., A Comparison Between Simultaneous and Hierarchical Approaches to Solve a Multi-Objective Location-Routing Problem.- M. Bodirsky et al., Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables.- M. Cacciola et al., A Lagrangian approach to Chance Constrained Routing with Local Broadcast.- P. Detti et al., A metaheuristic approach for biological sample transportation in healthcare.- Diego M. Pinto and G. Stecca, Optimal Planning of Waste Sorting Operations through Mixed Integer Linear Programming.- G. Micheli et al., Selecting and Initializing Representative Days for Generation and Transmission Expansion Planning with High Shares of Renewables.- T. Bacci et al., Start-up/Shut-down MINLP formulations for the Unit Commitment with Ramp Constraints.- J. Lee et al., Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions.- M. Aprile et al., Recognizing Cartesian products of matrices and polytopes.- A. Frank, Special subclass of Generalized Semi-Markov Decision Processes with discrete time.- R. Seccia et al., Coupling Machine Learning and Integer Programming for Optimal TV Promo Scheduling.- F. Mendoza-Granada and M. Villagra, A Distributed Algorithm for Spectral SparsiFication of Graphs with Applications to Data Clustering.
Copyright Date
2021
Topic
Operations Research, General, Optimization, Discrete Mathematics
Dewey Decimal
519.64
Dewey Edition
23
Illustrated
Yes
Genre
Business & Economics, Mathematics

Item description from the seller

grandeagleretail

grandeagleretail

98.2% positive feedback
2.7M items sold
Usually responds within 24 hours

Detailed Seller Ratings

Average for the last 12 months

Accurate description
4.9
Reasonable shipping cost
5.0
Shipping speed
4.9
Communication
4.9

Seller feedback (1,023,225)

g***j (1928)- Feedback left by buyer.
Past month
Verified purchase
What we needed--well packaged--quick shipping--pleased with purchase--we recommend this seller++++++++
n***r (269)- Feedback left by buyer.
Past month
Verified purchase
Smooth transaction
e***g (279)- Feedback left by buyer.
Past month
Verified purchase
Fast shipping and well packed! A- one seller!