A branch and bound method for solving the bidirectional circular layout problem (Q5961820): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound method for solving the bidirectional circular layout problem
+Normal rank
@@ Property / cites work @@
+A location problem on unicyclic networks: Balanced case
+Normal rank
@@ Property / cites work @@
+Optimal Linear Ordering
@@ Property / cites work: Optimal Linear Ordering / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the One-Dimensional Space Allocation Problem
@@ Property / cites work: On the One-Dimensional Space Allocation Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
+Normal rank
@@ Property / cites work @@
+Tree-search algorithms for quadratic assignment problems
+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 / Wikidata QID @@
+Q126666733
@@ Property / Wikidata QID: Q126666733 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0307-904x(95)00124-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2055423535
@@ Property / OpenAlex ID: W2055423535 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5961820