The following pages link to (Q3655163):
Displaying 16 items.
- Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (Q353698) (← links)
- Packing circular-like objects in a rectangular container (Q499146) (← links)
- Optimal correction of execution intervals for multiprocessor scheduling with additional resource (Q499147) (← links)
- Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
- Planning calculations in a multiprocessor system with unspecified moments of operational readiness (Q1995343) (← links)
- Method of characteristic functions for classes of networks with fixed node degrees (Q2017647) (← links)
- Distribution of a heterogeneous set of resources in multiprocessor scheduling (Q2134302) (← links)
- Optimization of the structure of a real-time multiprocessor system (Q2171299) (← links)
- Some algorithms of solving minimax multiprocessor scheduling problem (Q2263888) (← links)
- Multiperiod and stochastic formulations for a closed loop supply chain with incentives (Q2263889) (← links)
- Network optimization and problems with coupling variables (Q2263904) (← links)
- Irregular optimization models and \(p\)-order Kuhn-Tucker optimality conditions (Q2263906) (← links)
- Hypergraph recovery algorithms from a given vector of vertex degrees (Q2263922) (← links)
- Nonlinear integer transportation problem with additional supply and consumption points (Q2515394) (← links)
- Comparing node degrees in probabilistic networks (Q4958787) (← links)
- Methods and models of project resource management under uncertainty (Q6178132) (← links)
