scientific article; zbMATH DE number 3542191

From MaRDI portal

Revision as of 09:08, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4117605

Jump to:navigation, search

zbMath0347.90065MaRDI QIDQ4117605

Michel Minoux

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10)

Related Items (9)

A new approach for crew pairing problems by column generation with an application to air transportation ⋮ A constrained Steiner tree problem ⋮ Lagrangean decomposition: A model yielding stronger lagrangean bounds ⋮ An improved bounding procedure for the constrained assignment problem ⋮ The Steiner tree problem with delays: a compact formulation and reduction procedures ⋮ Lagrangean/surrogate relaxation for generalized assignment problems ⋮ An application-oriented guide for designing Lagrangean dual ascent algorithms ⋮ A heuristic approach to hard constrained shortest path problems ⋮ Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4117605&oldid=17897376"