Pages that link to "Item:Q5378742"

The following pages link to Discrete-Variable Extremum Problems (Q5378742):

Displaying 50 items.

• On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
• Simulation-optimization approaches for water pump scheduling and pipe replacement problems (Q319761) (← links)
• Decentral allocation planning in multi-stage customer hierarchies (Q319792) (← links)
• Optimal product line pricing in the presence of budget-constrained consumers (Q320658) (← links)
• Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
• Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic (Q333075) (← links)
• Integrated model for software component selection with simultaneous consideration of implementation and verification (Q339707) (← links)
• The most efficient critical vaccination coverage and its equivalence with maximizing the herd effect (Q343067) (← links)
• A Modified Binary Particle Swarm Optimization for Knapsack Problems (Q387477) (← links)
• A multi-period renewal equipment problem (Q439598) (← links)
• A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs (Q480938) (← links)
• The problem of maximum flow with minimum attainable cost in a network (Q505156) (← links)
• The transit route arc-node service maximization problem (Q621660) (← links)
• An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759) (← links)
• Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations (Q724114) (← links)
• \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (Q829173) (← links)
• An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950) (← links)
• On relocation problems with multiple identical working crews (Q865754) (← links)
• Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem (Q875412) (← links)
• Sparse grid quadrature on products of spheres (Q891778) (← links)
• Progress in presolving for mixed integer programming (Q903920) (← links)
• CON due-date determination and sequencing (Q908841) (← links)
• Exact and heuristic solution approaches for the mixed integer setup knapsack problem (Q928018) (← links)
• Qos-aware service evaluation and selection (Q932236) (← links)
• Single-vendor multi-buyer inventory coordination under private information (Q933523) (← links)
• George Dantzig's contributions to integer programming (Q951090) (← links)
• Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
• \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems (Q951128) (← links)
• Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem (Q955337) (← links)
• A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections (Q1007645) (← links)
• Geometric quadrisection in linear time, with application to VLSI placement (Q1019299) (← links)
• A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
• Knapsack problems with setups (Q1041933) (← links)
• Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
• Qualitative programming for selection decisions (Q1091931) (← links)
• A new enumeration scheme for the knapsack problem (Q1095029) (← links)
• An exact algorithm for large multiple knapsack problems (Q1124710) (← links)
• Scheduling to minimize weighted earliness and tardiness about a common due-date (Q1186924) (← links)
• An algorithm for storage device selection and file assignment (Q1194722) (← links)
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074) (← links)
• An adaptation of SH heuristic to the location set covering problem (Q1278140) (← links)
• A surrogate heuristic for set covering problems (Q1342046) (← links)
• A polynomial approximation scheme for the subset sum problem (Q1346700) (← links)
• A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
• An expanding-core algorithm for the exact \(0-1\) knapsack problem (Q1390271) (← links)
• New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935) (← links)
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
• A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)