The following pages link to (Q3993418):
Displaying 50 items.
- Bin-Packing-Based Planning of Agile Releases (Q3058782) (← links)
- Indices of Power in Optimal IDS Default Configuration: Theory and Examples (Q3098091) (← links)
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees (Q3100698) (← links)
- Some integer programs arising in the design of main frame computers (Q3135915) (← links)
- Dimensioning multicast-enabled communications networks (Q3150132) (← links)
- Solving the Hub location problem in telecommunication network design: A local search approach (Q3156824) (← links)
- Minimal Subsidies in Expense Sharing Games (Q3162532) (← links)
- Bilevel Knapsack with Interdiction Constraints (Q3186662) (← links)
- Smart Production by Integrating Product-Mix Planning and Revenue Management for Semiconductor Manufacturing (Q3299232) (← links)
- Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants (Q3304198) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
- Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized <i>cμ</i>/<i>h</i> Rule (Q3387963) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- New heuristic methods for the capacitated multi-facility Weber problem (Q3442870) (← links)
- Allocation of resources of modular sizes with an application to Internet Protocol (IP) address allocation (Q3442910) (← links)
- A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem (Q3449428) (← links)
- Initial Shipment Decisions for New Products at Zara (Q3453326) (← links)
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
- Multi-objective Problems in Terms of Relational Algebra (Q3498407) (← links)
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (Q3507347) (← links)
- An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core (Q3628453) (← links)
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
- A Fast Approximation Algorithm For The Subset-Sum Problem (Q4313818) (← links)
- An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case (Q4456074) (← links)
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 (Q4546065) (← links)
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
- Bilevel “Defender–Attacker” Model with Multiple Attack Scenarios (Q4558293) (← links)
- A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem (Q4558310) (← links)
- Table space designs for implicit and explicit concurrent tabled evaluation (Q4559837) (← links)
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (Q4603929) (← links)
- MYOPIC POLICIES FOR NON-PREEMPTIVE SCHEDULING OF JOBS WITH DECAYING VALUE (Q4628406) (← links)
- Optimal bounds for the change-making problem (Q4630257) (← links)
- Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date (Q4634328) (← links)
- Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
- Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
- The stochastic single resource service-provision problem (Q4651738) (← links)
- Checkerboard pattern: proposals for its generation (Q4669796) (← links)
- Modeling and analyzing multiple station baggage screening security system performance (Q4680453) (← links)
- The continuous-time single-sourcing problem with capacity expansion opportunities (Q4680460) (← links)
- Measurable Multiattribute Value Functions for Portfolio Decision Analysis (Q4691963) (← links)
- (Q4945108) (← links)
- Subset Selection in Sparse Matrices (Q4961001) (← links)
- On the Proximity of the Optimal Values of the Multi-dimensional Knapsack Problem with and Without the Cardinality Constraint (Q4965095) (← links)
- Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty (Q4994141) (← links)
- Comparative Analysis of Constraint Handling Techniques Based on Taguchi Design of Experiments (Q5011409) (← links)
- A Fast Algorithm for Knapsack Problem with Conflict Graph (Q5024916) (← links)
- Method for solving the Backpack Problem with an additional restriction on the number of items types (Q5053523) (← links)
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
