✦ LIBER ✦

A linear programming formulation for the maximum complete multipartite subgraph problem

✍ Scribed by Denis Cornaz

Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 238 KB
Volume: 105
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-005-0656-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Integer linear programming formulation f

Integer linear programming formulation for a vehicle routing problem

✍ N.R. Achuthan; L. Caccetta 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 254 KB

An ILP formulation and genetic algorithm

An ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem

✍ Milena Bogdanović 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 344 KB

A general instance of a Degree-Constrained Subgraph problem may be found in an edgeweighted or vertex-weighted graph G whereas the objective is to find an optimal weighted subgraph, subject to certain degree constraints on the vertices of the subgraph. This class of combinatorial problems has been e

A linear time algorithm for the Bottlene

A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem

✍ Gurmeet Singh Manku 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 621 KB

Multi-parametric analysis of the maximum

Multi-parametric analysis of the maximum tolerance in a linear programming problem

✍ Hsiao-Fan Wang; Chen-Sheng Huang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 674 KB

A new integer programming formulation fo

A new integer programming formulation for the permutation flowshop problem

✍ A.M. Frieze; J. Yadegar 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 447 KB

A dynamic programming formulation for th

A dynamic programming formulation for the one machine sequencing problem

✍ P.J. Weeda 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 222 KB