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