Optimal Linear Ordering
From MaRDI portal
Publication:5183299
DOI10.1137/0125042zbMath0274.90061OpenAlexW2064535593MaRDI 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
Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems, On Cutwidth Parameterized by Vertex Cover, Generating lower bounds for the linear arrangement problem, Minimum Linear Arrangement of Series-Parallel Graphs, Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs, Embedding complete multi-partite graphs into Cartesian product of paths and cycles, Memory management optimization problems for integrated circuit simulators, The \(S\)-\textsc{labeling} problem: an algorithmic tour, Branch and bound for the cutwidth minimization problem, The mixed page number of graphs, Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path, An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs, Multiterminal flows and cuts, Efficient algorithms for single- and two-layer linear placement of parallel graphs, Wirelength of embedding complete multipartite graphs into certain graphs, New relationships for multi-neighborhood search for the minimum linear arrangement problem, Graph layout problems, A polynomially solvable case of optimal linear extension problem of a poset, A heuristic procedure for the single-row facility layout problem, Parallel algorithms for the minimum cut and the minimum length tree layout problems, Optimization of location of interconnected facilities on parallel lines with forbidden zones, Efficient parallel algorithms for some tree layout problems, A New Lower Bound for the Minimum Linear Arrangement of a Graph, Sequencing with general precedence constraints, The Rique-number of graphs, On the measurement of complexity in activity networks, Task scheduling with precedence constraints to minimize the total completion time, Monoidal Width: Capturing Rank Width, A polynomial algorithm for some preemptive multiprocessor task scheduling problems, LAD models, trees, and an analog of the fundamental theorem of arithmetic, A variation on the min cut linear arrangement problem, Methods for the one-dimensional space allocation problem, On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules, On cutwidth parameterized by vertex cover, Molecular solution to the optimal linear arrangement problem based on DNA computation, Scheduling multiprocessor tasks for mean flow time criterion, Minimal cutwidth linear arrangements of abelian Cayley graphs, An optimal time algorithm for minimum linear arrangement of chord graphs, Single-machine scheduling with supporting tasks, Recent models and techniques for solving the layout problem, Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints, An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem, Scatter search for the cutwidth minimization problem, Room allocation: a polynomial subcase of the quadratic assignment problem, On the exact solution of a facility layout problem, Some simplified NP-complete graph problems, Data analysis implications of some concepts related to the cuts of a graph, Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time, Single-machine scheduling with an external resource, 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, A branch and bound algorithm for the minimum storage-time sequencing problem, Parameterized algorithmics for linear arrangement problems, An intermediate-value theorem for optimum tree valuation, Linear time algorithms to solve the linear ordering problem for oriented tree based graphs, Minimum linear arrangement of chord graphs, Experiments on the minimum linear arrangement problem, Effective solution of certain problems of theory of schedulings of nets, The use of dynamic programming in genetic algorithms for permutation problems, Minimizing the location length of a directed graph, On minimum cuts and the linear arrangement problem, Comparing linear width parameters for directed graphs, Using precedence intervals to solve constrained precedence problems, A semidefinite optimization approach for the single-row layout problem with unequal dimensions, On optimal linear arrangements of trees, Linear time algorithms on mirror trees, Efficient models for the facility layout problem
