Yamada et al., 2002 - Google Patents
Heuristic and exact algorithms for the disjunctively constrained knapsack problemYamada et al., 2002
View PDF- Document ID
- 11653788271799797720
- Author
- Yamada T
- Kataoka S
- Watanabe K
- Publication year
- Publication venue
- Information Processing Society of Japan Journal
External Links
Snippet
We arc concerned with a variation of the knapsack problem (KP), where some items are incompatible with some others. As In ordinary KPs, each item is associated with profit and weight. wc have a knapsack of a fixed capacity, and the problem is to determino the set of …
- 230000006399 behavior 0 description 3
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Programme initiating; Programme switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Yamada et al. | Heuristic and exact algorithms for the disjunctively constrained knapsack problem | |
Sidney | Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs | |
Van Roy | A cross decomposition algorithm for capacitated facility location | |
Ruszczyński | Parallel decomposition of multistage stochastic programming problems | |
Fisher | Optimal solution of scheduling problems using Lagrange multipliers: Part I | |
Shah et al. | A general algorithm for short-term scheduling of batch operations—II. Computational issues | |
CN113033811B (en) | Processing method and device for two-quantum bit logic gate | |
Chen et al. | An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem | |
Dahl et al. | Routing through virtual paths in layered telecommunication networks | |
US11252077B2 (en) | Network service transmission method and system | |
Segura et al. | Parallel island-based multiobjectivised memetic algorithms for a 2D packing problem | |
Dechter et al. | A general scheme for multiple lower bound computation in constraint optimization | |
CN116011562A (en) | Operator processing method, operator processing device, electronic device and readable storage medium | |
Kaibel et al. | Finding descriptions of polytopes via extended formulations and liftings | |
Yang et al. | Stable-protocol admissible synchronizability for high-order singular complex networks with switching topologies | |
Gai et al. | Maximizing the throughput of a rotating seru with nonpreemptive discrete stations | |
Attiya et al. | Reliability oriented task allocation in heterogeneous distributed computing systems | |
Zoltan et al. | The dynamic pipeline paradigm | |
Khmelnitskaya et al. | The average covering tree value for directed graph games | |
STINSON | A BRANCH AND BOUND ALGORITHM FOR A GENERAL CLASS OF MULTIPLE RESOURCE-CONSTRAINED SCHEDULING PROBLEMS. | |
Fang et al. | A new model for lane reservation problem with time-dependent travel times | |
Khurana et al. | Improving mixed integer linear programming formulations | |
CN115952239B (en) | Expression-based distributed hierarchical computing system, electronic device and storage medium | |
Chand et al. | Finite‐production‐rate inventory models with first‐and second‐shift setups | |
Ekaka-a et al. | Stabilizing a mathematical model of stock market population system |