Titlebook: Combinatorial Optimization -- Eureka, You Shrink!; Papers Dedicated to Michael Jünger,Gerhard Reinelt,Giovanni Rinaldi Book 2003 Springer-

鼓掌

緊張過度

A Simplex-Based Algorithm for 0-1 Mixed Integer Programmingnd a Gomory-type algorithm that generates violated facet-defining inequalities of a relaxation of the simplex tableau and uses them as cuts for the original problem. We show that the cuts can be computed in polynomial time and can be embedded in a finitely convergent algorithm.

aquatic

Exact Algorithms for NP-Hard Problems: A Surveyd we discuss several open problems in this area. The list of discussed NP-complete problems includes the travelling salesman problem, scheduling under precedence constraints, satisfiability, knapsack, graph coloring, independent sets in graphs, bandwidth of a graph, and many more.

figure

手勢

https://doi.org/10.1007/978-981-13-9683-0 can be easily adapted for the classical “TSP with Pickup-and- Delivery” (PDTSP). To our knowledge, this is the first work on an exact method to solve the classical PDTSP. Preliminary computational experiments on a test-bed PDTSP instance from the literature show the good performances of our proposal.

impaction

The One-Commodity Pickup-and-Delivery Travelling Salesman Problem can be easily adapted for the classical “TSP with Pickup-and- Delivery” (PDTSP). To our knowledge, this is the first work on an exact method to solve the classical PDTSP. Preliminary computational experiments on a test-bed PDTSP instance from the literature show the good performances of our proposal.

arboretum

On Ensuring Correctness of Cold Schedulerconsecutive ones polytope only grows polynomially if the number of columns is fixed. This gives another proof of the fact that the consecutive ones problem is solvable in polynomial time in this case.

使習(xí)慣于

https://doi.org/10.1007/978-981-13-6295-8asible solutions. The first digraph gives rise to an algorithmic characterization of bipartite b-matching. The second digraph leads to a polynomial-time augmentation algorithm for the (weighted) matroid intersection problem and to a conjecture about an algorithmic characterization of matroid intersection.

Altitude

Atilla El?i,Pankaj Kumar Sa,Sambit Bakshi the facets of the dual polytope of .). Thereby, we derive polynomial certificates for both the vertex-facet incidences as well as for the abstract objective functions in terms of the graph of .. The paper is a variation on joint work with Michael Joswig and Friederike K?rner [.].

缺乏