𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comparison of ILP formulations for the RWA problem

✍ Scribed by B. Jaumard; C. Meyer; B. Thiongane

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
561 KB
Volume
4
Category
Article
ISSN
1573-4277

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Properties of some ILP formulations of a
Properties of some ILP formulations of a class of partitioning problems
✍ Alberto Caprara πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 841 KB

We discuss possible integer linear programming formulations of a class of partitioning problems, which includes vertex (and edge) coloring and bin packing, and present some basic properties of the associated linear programming relaxations, possibly improved by means of valid inequalities. In particu

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

Formulation and comparison of algorithms
Formulation and comparison of algorithms for frictional contact problems
✍ P. W. Christensen; A. Klarbring; J. S. Pang; N. StrΓΆmberg πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 215 KB πŸ‘ 1 views

This paper presents two algorithms for solving the discrete, quasi-static, small-displacement, linear elastic, contact problem with Coulomb friction. The algorithms are adoptions of a Newton method for solving B-di erentiable equations and an interior point method for solving smooth, constrained equ