The following pages link to (Q3993418):
Displaying 50 items.
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
- The pyramidal capacitated vehicle routing problem (Q2270294) (← links)
- Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124) (← links)
- A well-solvable special case of the bounded knapsack problem (Q2275577) (← links)
- The stochastic transportation problem with single sourcing (Q2275818) (← links)
- A subset-sum type formulation of a two-agent single-machine scheduling problem (Q2281162) (← links)
- Choosing the capacity of arcs with constraint on flow delay time (Q2281352) (← links)
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (Q2282074) (← links)
- Shortest path tour problem with time windows (Q2282521) (← links)
- Heuristics for packing semifluids (Q2286867) (← links)
- A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
- Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings (Q2295861) (← links)
- Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (Q2300641) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders (Q2307325) (← links)
- Multi-index stochastic collocation for random PDEs (Q2309190) (← links)
- A sparse-grid isogeometric solver (Q2310938) (← links)
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- On a class of covering problems with variable capacities in wireless networks (Q2339450) (← links)
- Hierarchical multiple criteria optimization of maintenance activities on power distribution networks (Q2341278) (← links)
- Average-case performance of rollout algorithms for knapsack problems (Q2349849) (← links)
- \(\gamma\)-robust facility relocation problem (Q2355805) (← links)
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time (Q2355812) (← links)
- Combining very large scale and ILP based neighborhoods for a two-level location problem (Q2356178) (← links)
- Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization (Q2356258) (← links)
- Knapsack problem with objective value gaps (Q2361124) (← links)
- Knapsack allocation of multiple resources in benefit-cost analysis by way of the analytic hierarchy process (Q2365534) (← links)
- A pegging approach to the precedence-constrained knapsack problem (Q2371351) (← links)
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems (Q2371518) (← links)
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls (Q2378454) (← links)
- Multiobjective traveling salesperson problem on Halin graphs (Q2378458) (← links)
- Approximation schemes for a class of subset selection problems (Q2381527) (← links)
- A versatile algorithm for assembly line balancing (Q2383104) (← links)
- A cross entropy algorithm for the Knapsack problem with setups (Q2384601) (← links)
- Packing items to feed assembly lines (Q2384618) (← links)
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
- Solving the hub location problem with modular link capacities (Q2387305) (← links)
- Fuzzy approach to multilevel knapsack problems (Q2387353) (← links)
- Ranking of decision rules with random power distribution (Q2389765) (← links)
- A cutting plane method for knapsack polytope (Q2391714) (← links)
- Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- New formulations for variable cost and size bin packing problems with item fragmentation (Q2414120) (← links)
- A polynomial algorithm for a continuous bilevel knapsack problem (Q2417096) (← links)
- Resource allocation for epidemic control across multiple sub-populations (Q2417535) (← links)
- Knapsack problems: a parameterized point of view (Q2419116) (← links)
- A study on load-balanced variants of the bin packing problem (Q2422735) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- Location of slaughterhouses under economies of scale (Q2433439) (← links)
