The following pages link to (Q3993418):
Displaying 50 items.
- Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches (Q2027058) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
- The assignment and loading transportation problem (Q2029276) (← links)
- On the Stackelberg knapsack game (Q2029942) (← links)
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Competence-based assignment of tasks to workers in factories with demand-driven manufacturing (Q2045620) (← links)
- Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915) (← links)
- The continuous knapsack problem with capacities (Q2059181) (← links)
- New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
- A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs (Q2063190) (← links)
- Mirror scheduling problems with early work and late work criteria (Q2066692) (← links)
- Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances (Q2076814) (← links)
- A branch-and-bound algorithm for the quadratic multiple knapsack problem (Q2076914) (← links)
- New formulations and solutions for the strategic berth template problem (Q2076915) (← links)
- When two-constraint binary knapsack problem is equivalent to classical knapsack problem? (Q2080121) (← links)
- Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach (Q2080825) (← links)
- Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
- Learning-based multi-objective evolutionary algorithm for batching decision problem (Q2108120) (← links)
- On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
- MDDs boost equation solving on discrete dynamical systems (Q2117218) (← links)
- Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints (Q2140338) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Exact algorithms for the 0-1 time-bomb knapsack problem (Q2147139) (← links)
- Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
- Smallest covering regions and highest density regions for discrete distributions (Q2155016) (← links)
- Exact algorithms for scheduling programs with shared tasks (Q2156317) (← links)
- Optimal trade-off between sample size, precision of supervision, and selection probabilities for the unbalanced fixed effects panel data model (Q2156597) (← links)
- The Modular Subset-Sum Problem and the size of deletion correcting codes (Q2161417) (← links)
- A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning (Q2163207) (← links)
- Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
- The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees (Q2168712) (← links)
- A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices (Q2171595) (← links)
- The cross-impact analysis of innovative projects in a portfolio (Q2173805) (← links)
- Lot-size scheduling of a single product on unrelated parallel machines (Q2174901) (← links)
- Exact algorithms to minimize makespan on single and parallel batch processing machines (Q2183850) (← links)
- Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem (Q2185833) (← links)
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
- Resource allocation based on redundancy models for high availability cloud (Q2218493) (← links)
- Approximating the product knapsack problem (Q2230782) (← links)
- Introduction of an underground waste container system-model and solution approaches (Q2239914) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
- Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems (Q2257352) (← links)
- Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations (Q2261724) (← links)
- Bees algorithm for generalized assignment problem (Q2266951) (← links)
