A mean-variance model for the minimum cost flow problem with stochastic arc costs | Semantic Scholar (2024)

It is shown that the mixed search number of permutation graphs can be computed in linear time, and an algorithm for this purpose is described, and a complete characterization of the edge searchNumber of complete bipartite graphs is given.

A polynomial-time algorithm is designed which, given any n-node tree T, computes the exclusive search number of T in time O(n3), and it is proved that the ratio between the exclusive search number and the pathwidth of a graph is bounded by its maximum degree.

The proof of NP-completeness of the decision version of the problem, derives tight theoretical bounds, as well as develops a heuristic algorithm for the considered problems, which are extremely challenging to solve to optimality even for small networks.

This paper presents a model of the traveling salesman problem that incorporates risk constraints based on Conditional Value at Risk to evaluate those worst-cost scenarios and shows the ability of the proposed methods in reducing the computational complexity.

This dissertation proposes two new solution approaches to the QAP, namely, a Branch-and-Bound method and a discrete dynamic convexized method that use the standard quadratic integer programming formulation of theQAP.

This work investigates optimization models for topology designs that enable end-to-end dual-path support on a distributed wireless sensor network and eliminates some of the typical assumptions made in the pertinent network design literature that are too strong in this application context.

...

...

This paper gives a simple algorithm for constructing sparse spanners for arbitrary weighted graphs and applies this algorithm to obtain specific results for planar graphs and Euclidean graphs.

A unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected, and total domination problems, on interval graphs on circular-arc graphs is presented.

A special merging rule for creating an offspring that exploits the special structure of the quadratic assignment problem is designed and a new type of a tabu search, which is applied on the offspring before consideration for inclusion in the population is designed.

This work identifies a template for scatter search and path relinking methods that provides a convenient and user friendly basis for their implementation and describes Illustrative forms of these subroutines that make it possible to create methods for a wide range of optimization problems.

A new heuristic is proposed for the solution of the quadratic assignment problem that combines ideas from tabu search and genetic algorithms and performed very well on a set of test problems.

The results indicate that exact solutions by means of a basic integer programming model can be obtained in reasonably short time even on networks with 800 vertices and around 287,000 edges.

A novel graph-theoretical characterization of 2-node-connected graphs via orientation properties is derived, which allows us to derive two classes of ILP formulations based on directed graphs, one using multi-commodity flow and one using cut-inequalities.

...

...