Scheduling to Minimize Interaction Cost

Cited In (74)

Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints
Die Anwendung der Dynamischen Optimierung bei der Sozial-Sanitären Bezirkseinteilung
A two-level graph partitioning problem arising in mobile wireless communications
The proportional coloring problem: optimizing buffers in radio mesh networks
The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks
Invariant imbedding and parallelism in dynamic programming for feedback control
On \(n\)-stage, \(m\)-reusableness rate production planning problems
Optimization techniques in energy calculations involving the Hartree-Fock density matrix
Dynamic programming and graph optimization problems
Exploiting sparsity for the min \(k\)-partition problem
Use of dynamic programming to accelerate convergence of directional optimization algorithms
The bottleneck independent domination on the classes of bipartite graphs and block graphs.
Timetabling problem for university as assignment of activities to resources
Sensitivity analysis in discrete dynamic programming
Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme
Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
A tool-change scheduling model for machining centres
The indefinite zero-one quadratic problem
Term-end exam scheduling at United States Military Academy/West Point
On local search for the generalized graph coloring problem
On a language for discrete dynamic programming and a microcomputer implementation
Multicriteria dynamic programming with an application to the integer case
Interactive fuzzy goal programming approach for bilevel programming problem
On Markov policies for minimax decision processes
New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
An asymptotically exact polynomial algorithm for equipartition problems
Solvable classes of discrete dynamic programming
Conditional decision processes with recursive function
A mathematical model and a metaheuristic approach for a memory allocation problem
Tabu search for large scale timetabling problems
Some comments on preference order dynamic programming models
Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
An improved algorithm for non-linear integer programming
A dual algorithm for the one-machine scheduling problem
Dynamic programming applications to water resource system operation and planning
Some operations on dynamic programmings with one-dimensional state space
A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
Finding a feasible course schedule using Tabu search
Register assignment in tree-structured programs
Inverse theorem in dynamic programming. I
The weighted perfect domination problem
Projection results for the \(k\)-partition problem
Dynamic programming: An interactive approach
Optimal control of a birth-and-death process population model
Easy and hard bottleneck location problems
A quadratic assignment problem without column constraints
A goal programming procedure for solving problems with multiple fuzzy goals using dynamic programming
Scheduling activities among conflicting facilities to minimize conflict cost
Using \(xQx\) to model and solve the uncapacitated task allocation problem
Application of orthogonal arrays and MARS to inventory forecasting stochastic dynamic programs.
A large scale timetabling problem
Political districting: From classical models to recent approaches
Constructing a course schedule by solving a series of assignment type problems
Political districting: from classical models to recent approaches
The concept of state in discrete dynamic programming
An exact approach for the multi-constraint graph partitioning problem
Adaptive differential dynamic programming for multiobjective optimal control
A strong formulation for the graph partition problem
An interactive dynamic programming approach to multicriteria discrete programming
Weighted graphs and university course timetabling
A new look at Bellman's principle of optimality
Ratio dynamic programs
Dynamical programming using singular perturbations
Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms
Bayesian birds: A simple example of Oaten's stochastic model of optimal foraging
A comparison of several dynamic programming models of the made-to-order production situation
Sequential minimaxization under dynamic programming structure
An exact algorithm for the concave transportation problem
The partition problem
Multilevel decomposition of nonlinear programming problems by dynamic programming
An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
The multiscenario lot size problem with concave costs.
Monotonicity and the principle of optimality

This page was built for publication: Scheduling to Minimize Interaction Cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5514166)