Pages that link to "Item:Q5514166"
From MaRDI portal
The following pages link to Scheduling to Minimize Interaction Cost (Q5514166):
Displaying 24 items.
- On local search for the generalized graph coloring problem (Q1870000) (← links)
- Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints (Q1885750) (← links)
- Invariant imbedding and parallelism in dynamic programming for feedback control (Q1906753) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
- An exact approach for the multi-constraint graph partitioning problem (Q2219514) (← links)
- The partition problem (Q2366610) (← links)
- Political districting: from classical models to recent approaches (Q2393445) (← links)
- Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
- The concept of state in discrete dynamic programming (Q2538061) (← links)
- Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms (Q2542395) (← links)
- Dynamic programming applications to water resource system operation and planning (Q2544549) (← links)
- Solvable classes of discrete dynamic programming (Q2563309) (← links)
- THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS (Q3166742) (← links)
- The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks (Q3503543) (← links)
- An improved branching scheme for the branch and bound procedure of scheduling<i>n</i>jobs on<i>m</i>parallel machines to minimize total weighted flowtime (Q3783064) (← links)
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach (Q3948895) (← links)
- Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme (Q4071009) (← links)
- Scheduling activities among conflicting facilities to minimize conflict cost (Q4079314) (← links)
- A dual algorithm for the one-machine scheduling problem (Q4131996) (← links)
- Die Anwendung der Dynamischen Optimierung bei der Sozial-Sanitären Bezirkseinteilung (Q4181596) (← links)
- A quadratic assignment problem without column constraints (Q5580104) (← links)
- Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks (Q5853723) (← links)
- On Markov policies for minimax decision processes (Q5927554) (← links)
- A strong formulation for the graph partition problem (Q6068542) (← links)