Discrete-variable extremum problems

Recommendations

scientific article; zbMATH DE number 3974735
scientific article; zbMATH DE number 3936928
scientific article; zbMATH DE number 3921350
Letter to the editor: Comment on Dantzig's paper on discrete variable extremum problems
Symposium on modern techniques for extremum problems-linear and nonlinear programming

Cited in

(only showing first 100 items - show all)

A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections
Geometric quadrisection in linear time, with application to VLSI placement
A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
Knapsack problems with setups
Representability in mixed integer programming. I: Characterization results
Qualitative programming for selection decisions
A new enumeration scheme for the knapsack problem
An exact algorithm for large multiple knapsack problems
Scheduling to minimize weighted earliness and tardiness about a common due-date
An algorithm for storage device selection and file assignment
An upper bound for the zero-one knapsack problem and a branch and bound algorithm
An adaptation of SH heuristic to the location set covering problem
On solving discontinuous extremal problems
A surrogate heuristic for set covering problems
A polynomial approximation scheme for the subset sum problem
A minimal algorithm for the multiple-choice knapsack problem
An expanding-core algorithm for the exact 0-1 knapsack problem
New trends in exact algorithms for the \(0-1\) knapsack problem
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
A matheuristic approach to the orienteering problem with service time dependent profits
On the product knapsack problem
Optimizing healthcare network design under reference pricing and parameter uncertainty
Adaptive refinement strategies for the simulation of gas flow in networks using a model hierarchy
Finding representations for an unconstrained bi-objective combinatorial optimization problem
Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
Ellipsoidal mixed-integer representability
Representability of functions
A typology of cutting and packing problems
Approximation algorithms for fractional knapsack problems
Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
A heuristic for the problem of one-dimensional steel coil cutting
An integrated disaster preparedness model for retrofitting and relief item transportation
Exact solution techniques for two-dimensional cutting and packing
Superquantiles at work: machine learning applications and efficient subgradient computation
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
A new class of hard problem instances for the 0-1 knapsack problem
Knapsack problems -- an overview of recent advances. I: Single knapsack problems
Exact algorithms for the 0-1 time-bomb knapsack problem
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
Meso-parametric value function approximation for dynamic customer acceptances in delivery routing
Bounds on the objective value of feasible roundings
Two-row and two-column mixed-integer presolve using hashing-based pairing methods
Single-machine scheduling with machine unavailability periods and resource dependent processing times
A note on upper bounds to the robust knapsack problem with discrete scenarios
Bookings in the European gas market: characterisation of feasibility and computational complexity results
Asymptotically optimal algorithms for budgeted multiple play bandits
Allocating multiple defensive resources in a zero-sum game setting
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
Piece selection algorithms for layered video streaming in P2P networks
Combined location and routing problems for drug distribution
Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
Solving TSP through the integration of OR and CP techniques
Mixed integer linear programming formulation techniques
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
Optimal product line pricing in the presence of budget-constrained consumers
Robust efficiency measures for linear knapsack problem variants
Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
Presolve Reductions in Mixed Integer Programming
Dynamic scheduling of multiclass many-server queues with abandonment: the generalized \(c \mu / h\) rule
Integrated model for software component selection with simultaneous consideration of implementation and verification
The most efficient critical vaccination coverage and its equivalence with maximizing the herd effect
scientific article; zbMATH DE number 3974735 (Why is no real title available?)
A Modified Binary Particle Swarm Optimization for Knapsack Problems
A multi-period renewal equipment problem
A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem
A theory of learning with corrupted labels
Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs
Faster Pseudopolynomial Time Algorithms for Subset Sum
Explainable dynamic programming
High generalization performance structured self-attention model for knapsack problem
The problem of maximum flow with minimum attainable cost in a network
Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards
When human visual performance is imperfect -- how to optimize the collaboration between one human operator and multiple field robots
Solving LP relaxations of some NP-hard problems is as hard as solving any linear program
Digital traveler assistant
Letter to the editor: Comment on Dantzig's paper on discrete variable extremum problems
scientific article; zbMATH DE number 3197532 (Why is no real title available?)
Optimal Individualized Decision Rules Using Instrumental Variable Methods
Random knapsack in expected polynomial time
Delay-constrained minimum shortest path trees and related problems
Delay-constrained minimum shortest path trees and related problems
Lagrangian heuristics for the quadratic knapsack problem
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
The transit route arc-node service maximization problem
Algorithmic mechanism design with investment
The service rate region polytope
The stochastic bilevel selection problem
Optimal individualized treatments in resource-limited settings

This page was built for publication: Discrete-variable extremum problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378742)