The following pages link to Optimal Linear Ordering (Q5183299):
Displaying 50 items.
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules (Q456005) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- An optimal time algorithm for minimum linear arrangement of chord graphs (Q497140) (← links)
- A polynomially solvable case of optimal linear extension problem of a poset (Q613667) (← links)
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
- On optimal linear arrangements of trees (Q789395) (← links)
- Efficient models for the facility layout problem (Q803026) (← links)
- Methods for the one-dimensional space allocation problem (Q916571) (← links)
- Molecular solution to the optimal linear arrangement problem based on DNA computation (Q937692) (← links)
- Minimal cutwidth linear arrangements of abelian Cayley graphs (Q942098) (← links)
- Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (Q955602) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems (Q1080776) (← links)
- Efficient algorithms for single- and two-layer linear placement of parallel graphs (Q1130417) (← links)
- Sequencing with general precedence constraints (Q1142151) (← links)
- On the measurement of complexity in activity networks (Q1145062) (← links)
- Recent models and techniques for solving the layout problem (Q1197682) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- Data analysis implications of some concepts related to the cuts of a graph (Q1237024) (← links)
- An intermediate-value theorem for optimum tree valuation (Q1253929) (← links)
- The use of dynamic programming in genetic algorithms for permutation problems (Q1268271) (← links)
- A heuristic procedure for the single-row facility layout problem (Q1390259) (← links)
- Parallel algorithms for the minimum cut and the minimum length tree layout problems (Q1391312) (← links)
- On minimum cuts and the linear arrangement problem (Q1570828) (← links)
- The \(S\)-\textsc{labeling} problem: an algorithmic tour (Q1647835) (← links)
- New relationships for multi-neighborhood search for the minimum linear arrangement problem (Q1679609) (← links)
- Single-machine scheduling with supporting tasks (Q1751119) (← links)
- Scatter search for the cutwidth minimization problem (Q1761768) (← links)
- Room allocation: a polynomial subcase of the quadratic assignment problem (Q1765233) (← links)
- Minimizing the location length of a directed graph (Q1816096) (← links)
- Generating lower bounds for the linear arrangement problem (Q1891924) (← links)
- An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs (Q1924401) (← links)
- Multiterminal flows and cuts (Q1924611) (← links)
- LAD models, trees, and an analog of the fundamental theorem of arithmetic (Q1949097) (← links)
- Scheduling multiprocessor tasks for mean flow time criterion (Q1977621) (← links)
- Single-machine scheduling with an external resource (Q2030286) (← links)
- Linear time algorithms on mirror trees (Q2091108) (← links)
- The mixed page number of graphs (Q2167907) (← links)
- Wirelength of embedding complete multipartite graphs into certain graphs (Q2181259) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Memory management optimization problems for integrated circuit simulators (Q2383536) (← links)
- A polynomial algorithm for some preemptive multiprocessor task scheduling problems (Q2432888) (← links)
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem (Q2482382) (← links)
- On the exact solution of a facility layout problem (Q2496073) (← links)
- Minimum linear arrangement of chord graphs (Q2518728) (← links)
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
- Linear time algorithms to solve the linear ordering problem for oriented tree based graphs (Q2805488) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q3057614) (← links)
