Pages that link to "Item:Q5514166"
From MaRDI portal
The following pages link to Scheduling to Minimize Interaction Cost (Q5514166):
Displaying 50 items.
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
- A mathematical model and a metaheuristic approach for a memory allocation problem (Q519090) (← links)
- The indefinite zero-one quadratic problem (Q585083) (← links)
- Some operations on dynamic programmings with one-dimensional state space (Q598609) (← links)
- Political districting: From classical models to recent approaches (Q657583) (← links)
- Term-end exam scheduling at United States Military Academy/West Point (Q707689) (← links)
- Ratio dynamic programs (Q797504) (← links)
- Tabu search for large scale timetabling problems (Q806794) (← links)
- The weighted perfect domination problem (Q912630) (← links)
- Interactive fuzzy goal programming approach for bilevel programming problem (Q1002049) (← links)
- A new look at Bellman's principle of optimality (Q1060687) (← links)
- An asymptotically exact polynomial algorithm for equipartition problems (Q1076607) (← links)
- A comparison of several dynamic programming models of the made-to-order production situation (Q1079481) (← links)
- Sequential minimaxization under dynamic programming structure (Q1080369) (← links)
- Timetabling problem for university as assignment of activities to resources (Q1086142) (← links)
- Sensitivity analysis in discrete dynamic programming (Q1090253) (← links)
- A large scale timetabling problem (Q1112719) (← links)
- On a language for discrete dynamic programming and a microcomputer implementation (Q1112738) (← links)
- Easy and hard bottleneck location problems (Q1135201) (← links)
- An improved algorithm for non-linear integer programming (Q1136698) (← links)
- Register assignment in tree-structured programs (Q1140983) (← links)
- Bayesian birds: A simple example of Oaten's stochastic model of optimal foraging (Q1143335) (← links)
- Inverse theorem in dynamic programming. I (Q1145359) (← links)
- Some comments on preference order dynamic programming models (Q1156704) (← links)
- Dynamical programming using singular perturbations (Q1157566) (← links)
- Multicriteria dynamic programming with an application to the integer case (Q1158349) (← links)
- Dynamic programming: An interactive approach (Q1162454) (← links)
- An interactive dynamic programming approach to multicriteria discrete programming (Q1169938) (← links)
- Weighted graphs and university course timetabling (Q1185992) (← links)
- Finding a feasible course schedule using Tabu search (Q1186313) (← links)
- Optimal control of a birth-and-death process population model (Q1216110) (← links)
- An exact algorithm for the concave transportation problem (Q1233394) (← links)
- Multilevel decomposition of nonlinear programming problems by dynamic programming (Q1253184) (← links)
- A tool-change scheduling model for machining centres (Q1258683) (← links)
- An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs (Q1273613) (← links)
- Conditional decision processes with recursive function (Q1284032) (← links)
- Application of orthogonal arrays and MARS to inventory forecasting stochastic dynamic programs. (Q1285809) (← links)
- Constructing a course schedule by solving a series of assignment type problems (Q1296794) (← links)
- On \(n\)-stage, \(m\)-reusableness rate production planning problems (Q1321293) (← links)
- Optimization techniques in energy calculations involving the Hartree-Fock density matrix (Q1321298) (← links)
- Dynamic programming and graph optimization problems (Q1327180) (← links)
- The multiscenario lot size problem with concave costs. (Q1426700) (← links)
- The bottleneck independent domination on the classes of bipartite graphs and block graphs. (Q1429835) (← links)
- Adaptive differential dynamic programming for multiobjective optimal control (Q1614332) (← links)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem (Q1821011) (← links)
- Monotonicity and the principle of optimality (Q1838705) (← links)
- Use of dynamic programming to accelerate convergence of directional optimization algorithms (Q1843808) (← links)
- A goal programming procedure for solving problems with multiple fuzzy goals using dynamic programming (Q1869400) (← links)
