↓ Skip to main content
What is this page? Embed badge

Combinatorial Optimization

Overview of attention for book
Cover of 'Combinatorial Optimization'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs
  3. Altmetric Badge
    Chapter 2 A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix
  4. Altmetric Badge
    Chapter 3 On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration
  5. Altmetric Badge
    Chapter 4 Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions
  6. Altmetric Badge
    Chapter 5 The Parity Hamiltonian Cycle Problem in Directed Graphs
  7. Altmetric Badge
    Chapter 6 Lovász-Schrijver PSD-Operator on Claw-Free Graphs
  8. Altmetric Badge
    Chapter 7 Benders Decomposition for Capacitated Network Design
  9. Altmetric Badge
    Chapter 8 Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories
  10. Altmetric Badge
    Chapter 9 Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games
  11. Altmetric Badge
    Chapter 10 A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs
  12. Altmetric Badge
    Chapter 11 MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover
  13. Altmetric Badge
    Chapter 12 Towards an Accurate Solution of Wireless Network Design Problems
  14. Altmetric Badge
    Chapter 13 Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem
  15. Altmetric Badge
    Chapter 14 Towards a Polynomial Equivalence Between \(\{k\}\) -Packing Functions and k-Limited Packings in Graphs
  16. Altmetric Badge
    Chapter 15 Exact Solution Methods for the k-Item Quadratic Knapsack Problem
  17. Altmetric Badge
    Chapter 16 On Vertices and Facets of Combinatorial 2-Level Polytopes
  18. Altmetric Badge
    Chapter 17 Optimization Problems with Color-Induced Budget Constraints
  19. Altmetric Badge
    Chapter 18 Strengthening Chvátal-Gomory Cuts for the Stable Set Problem
  20. Altmetric Badge
    Chapter 19 Scheduling Personnel Retraining: Column Generation Heuristics
  21. Altmetric Badge
    Chapter 20 Diagonally Dominant Programming in Distance Geometry
  22. Altmetric Badge
    Chapter 21 A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels
  23. Altmetric Badge
    Chapter 22 An Algorithm for Finding a Representation of a Subtree Distance
  24. Altmetric Badge
    Chapter 23 A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks
  25. Altmetric Badge
    Chapter 24 Shared Multicast Trees in Ad Hoc Wireless Networks
  26. Altmetric Badge
    Chapter 25 Two-Level Polytopes with a Prescribed Facet
  27. Altmetric Badge
    Chapter 26 Optimum Solution of the Closest String Problem via Rank Distance
  28. Altmetric Badge
    Chapter 27 Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut
  29. Altmetric Badge
    Chapter 28 The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness
  30. Altmetric Badge
    Chapter 29 Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems
  31. Altmetric Badge
    Chapter 30 Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores
  32. Altmetric Badge
    Chapter 31 Balanced Partition of a Graph for Football Team Realignment in Ecuador
  33. Altmetric Badge
    Chapter 32 On a General Framework for Network Representability in Discrete Optimization
  34. Altmetric Badge
    Chapter 33 A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract)
  35. Altmetric Badge
    Chapter 34 Optimization Models for Multi-period Railway Rolling Stock Assignment
  36. Altmetric Badge
    Chapter 35 Sum-of-Squares Rank Upper Bounds for Matching Problems
  37. Altmetric Badge
    Chapter 36 A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases
  38. Altmetric Badge
    Chapter 37 The Maximum Matrix Contraction Problem
  39. Altmetric Badge
    Chapter 38 Integrated Production Scheduling and Delivery Routing: Complexity Results and Column Generation
Attention for Chapter 5: The Parity Hamiltonian Cycle Problem in Directed Graphs
Altmetric Badge

Citations

dimensions_citation
4 Dimensions
Summary Dimensions citations
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
The Parity Hamiltonian Cycle Problem in Directed Graphs
Chapter number 5
Book title
Combinatorial Optimization
Published in
Lecture notes in computer science, September 2016
DOI 10.1007/978-3-319-45587-7_5
Book ISBNs
978-3-31-945586-0, 978-3-31-945587-7
Authors

Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita

Editors

Raffaele Cerulli, Satoru Fujishige, A. Ridha Mahjoub

View on publisher site

This page is provided by Altmetric.