Discrete-Variable Extremum Problems
From MaRDI portal
Publication:5378742
DOI10.1287/opre.5.2.266zbMath1414.90353OpenAlexW2060322444WikidataQ28035735 ScholiaQ28035735MaRDI QIDQ5378742
Publication date: 3 June 2019
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.5.2.266
Related Items
Knapsack polytopes: a survey, A matheuristic approach to the orienteering problem with service time dependent profits, A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs, Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis, Representability in mixed integer programming. I: Characterization results, Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic, A surrogate heuristic for set covering problems, Qualitative programming for selection decisions, A new class of hard problem instances for the 0-1 knapsack problem, A new enumeration scheme for the knapsack problem, A polynomial approximation scheme for the subset sum problem, On the hardness of bribery variants in voting with CP-nets, Simulation-optimization approaches for water pump scheduling and pipe replacement problems, Decentral allocation planning in multi-stage customer hierarchies, Knapsack problems -- an overview of recent advances. I: Single knapsack problems, Exact algorithms for the 0-1 time-bomb knapsack problem, Optimal product line pricing in the presence of budget-constrained consumers, Robust efficiency measures for linear knapsack problem variants, Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item, An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem, Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic, The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective, The stochastic bilevel continuous knapsack problem with uncertain follower's objective, Integrated model for software component selection with simultaneous consideration of implementation and verification, On the product knapsack problem, A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem, The most efficient critical vaccination coverage and its equivalence with maximizing the herd effect, On relocation problems with multiple identical working crews, Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem, An exact algorithm for large multiple knapsack problems, A Modified Binary Particle Swarm Optimization for Knapsack Problems, A minimal algorithm for the multiple-choice knapsack problem, Meso-parametric value function approximation for dynamic customer acceptances in delivery routing, An expanding-core algorithm for the exact \(0-1\) knapsack problem, Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work, Sparse grid quadrature on products of spheres, Bounds on the objective value of feasible roundings, The transit route arc-node service maximization problem, Optimizing healthcare network design under reference pricing and parameter uncertainty, Progress in presolving for mixed integer programming, Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem, CON due-date determination and sequencing, Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards, A multi-period renewal equipment problem, Piece selection algorithms for layered video streaming in P2P networks, Two-row and two-column mixed-integer presolve using hashing-based pairing methods, Combined location and routing problems for drug distribution, Exact and heuristic solution approaches for the mixed integer setup knapsack problem, Qos-aware service evaluation and selection, Single-vendor multi-buyer inventory coordination under private information, A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs, An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics, Scheduling to minimize weighted earliness and tardiness about a common due-date, A heuristic for the problem of one-dimensional steel coil cutting, Adaptive refinement strategies for the simulation of gas flow in networks using a model hierarchy, The problem of maximum flow with minimum attainable cost in a network, Finding representations for an unconstrained bi-objective combinatorial optimization problem, Solving TSP through the Integration of OR and CP Techniques, Single-machine scheduling with machine unavailability periods and resource dependent processing times, George Dantzig's contributions to integer programming, Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes, \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems, An algorithm for storage device selection and file assignment, Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem, An integrated disaster preparedness model for retrofitting and relief item transportation, A note on upper bounds to the robust knapsack problem with discrete scenarios, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, Unnamed Item, Exact solution techniques for two-dimensional cutting and packing, Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations, An upper bound for the zero-one knapsack problem and a branch and bound algorithm, Random knapsack in expected polynomial time, Ellipsoidal mixed-integer representability, A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections, Mixed Integer Linear Programming Formulation Techniques, \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs, Bookings in the European gas market: characterisation of feasibility and computational complexity results, Presolve Reductions in Mixed Integer Programming, Faster Pseudopolynomial Time Algorithms for Subset Sum, Geometric quadrisection in linear time, with application to VLSI placement, Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ/h Rule, When Human Visual Performance Is Imperfect—How to Optimize the Collaboration Between One Human Operator and Multiple Field Robots, An adaptation of SH heuristic to the location set covering problem, Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program, Superquantiles at work: machine learning applications and efficient subgradient computation, Representability of functions, A typology of cutting and packing problems, New trends in exact algorithms for the \(0-1\) knapsack problem, A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem, Knapsack problems with setups, Digital Traveler Assistant, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Asymptotically optimal algorithms for budgeted multiple play bandits, Optimal Individualized Decision Rules Using Instrumental Variable Methods, Explainable dynamic programming, Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems, Allocating multiple defensive resources in a zero-sum game setting, High generalization performance structured self-attention model for knapsack problem, Approximation algorithms for fractional knapsack problems, Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems, Integer knapsack problems with profit functions of the same value range, Min‐sum controllable risk problems with concave risk functions of the same value range, A multi‐vehicle covering tour problem with speed optimization, Prioritizing municipal lead mitigation projects as a relaxed knapsack optimization: a method and case study, An integer linear optimization model to the compartmentalized knapsack problem, Features for the 0-1 knapsack problem based on inclusionwise maximal solutions, High order entropy stable discontinuous Galerkin spectral element methods through subcell limiting, Lagrangian heuristics for the quadratic knapsack problem, Delay-constrained minimum shortest path trees and related problems, Delay-constrained minimum shortest path trees and related problems
