Optimal Linear Ordering
From MaRDI portal
Publication:5183299
DOI10.1137/0125042zbMath0274.90061MaRDI QIDQ5183299
No author found.
Publication date: 1973
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0125042
Related Items
A branch and bound algorithm for the minimum storage-time sequencing problem, Task scheduling with precedence constraints to minimize the total completion time, Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs, Experiments on the minimum linear arrangement problem, A branch and bound method for solving the bidirectional circular layout problem, A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem, On optimal linear arrangements of trees, Efficient models for the facility layout problem, Methods for the one-dimensional space allocation problem, Molecular solution to the optimal linear arrangement problem based on DNA computation, Minimal cutwidth linear arrangements of abelian Cayley graphs, Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints, Parameterized algorithmics for linear arrangement problems, Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems, Efficient algorithms for single- and two-layer linear placement of parallel graphs, Sequencing with general precedence constraints, On the measurement of complexity in activity networks, Recent models and techniques for solving the layout problem, Some simplified NP-complete graph problems, Data analysis implications of some concepts related to the cuts of a graph, An intermediate-value theorem for optimum tree valuation, The use of dynamic programming in genetic algorithms for permutation problems, A heuristic procedure for the single-row facility layout problem, Parallel algorithms for the minimum cut and the minimum length tree layout problems, On minimum cuts and the linear arrangement problem, Room allocation: a polynomial subcase of the quadratic assignment problem, Minimizing the location length of a directed graph, Generating lower bounds for the linear arrangement problem, An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs, Multiterminal flows and cuts, Scheduling multiprocessor tasks for mean flow time criterion, Memory management optimization problems for integrated circuit simulators, A polynomial algorithm for some preemptive multiprocessor task scheduling problems, An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem, On the exact solution of a facility layout problem, Minimum linear arrangement of chord graphs, A semidefinite optimization approach for the single-row layout problem with unequal dimensions, A New Lower Bound for the Minimum Linear Arrangement of a Graph, Using precedence intervals to solve constrained precedence problems, A variation on the min cut linear arrangement problem, Effective solution of certain problems of theory of schedulings of nets
