Resource constrained assignment problems (Q1264090): Difference between revisions

This paper studies the resource constrained assignment problem from a polyhedral approach. Several classes of valid inequalities based on the properties of the knapsack and assignment polytopes are derived.

0 references

zbMATH Keywords

resource constrained assignment

0 references

polyhedral approach

0 references

valid inequalities

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A Lagrangean relaxation method for the constrained assignment problem

0 references

Facets of the knapsack polytope

0 references

A new algorithm for the assignment problem

0 references

Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis

0 references

The Lagrangian Relaxation Method for Solving Integer Programming Problems

0 references

Q3714901

0 references

Resource-Constrained Assignment Scheduling

0 references

Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost

0 references

full work available at URL

https://doi.org/10.1016/0166-218x(90)90099-x

0 references

Identifiers

zbMATH Open document ID

0688.90039

0 references

DOI

10.1016/0166-218X(90)90099-X

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1264090

@@ Property / author @@
+Kurt O. Jørnsten
@@ Property / author: Kurt O. Jørnsten / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A Lagrangean relaxation method for the constrained assignment problem
+Normal rank
@@ Property / cites work @@
+Facets of the knapsack polytope
@@ Property / cites work: Facets of the knapsack polytope / rank @@
+Normal rank
@@ Property / cites work @@
+A new algorithm for the assignment problem
@@ Property / cites work: A new algorithm for the assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
+Normal rank
@@ Property / cites work @@
+The Lagrangian Relaxation Method for Solving Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Q3714901
@@ Property / cites work: Q3714901 / rank @@
+Normal rank
@@ Property / cites work @@
+Resource-Constrained Assignment Scheduling
@@ Property / cites work: Resource-Constrained Assignment Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(90)90099-x
+Normal rank
@@ Property / OpenAlex ID @@
+W1985482879
@@ Property / OpenAlex ID: W1985482879 / rank @@
+Normal rank