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)

Allocating multiple defensive resources in a zero-sum game setting
scientific article; zbMATH DE number 3974735 (Why is no real title available?)
Ellipsoidal mixed-integer representability
Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
Approximation algorithms for fractional knapsack problems
Scheduling to minimize weighted earliness and tardiness about a common due-date
Exact and heuristic solution approaches for the mixed integer setup knapsack problem
Knapsack problems with setups
Optimizing healthcare network design under reference pricing and parameter uncertainty
An expanding-core algorithm for the exact 0-1 knapsack problem
Superquantiles at work: machine learning applications and efficient subgradient computation
A note on upper bounds to the robust knapsack problem with discrete scenarios
An exact algorithm for large multiple knapsack problems
Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
A greedy hypervolume polychotomic scheme for multiobjective combinatorial optimization
Novel valid inequalities and branch-and-price for Stackelberg security games
A branch-and-price algorithm for the single machine scheduling problem with periodic maintenance to minimize makespan
A polynomial approximation scheme for the subset sum problem
An algorithm for storage device selection and file assignment
Removable online knapsack and advice
An integer linear optimization model to the compartmentalized knapsack problem
A new enumeration scheme for the knapsack problem
Combined location and routing problems for drug distribution
Qos-aware service evaluation and selection
Single-machine scheduling with machine unavailability periods and resource dependent processing times
An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem
Algorithmic mechanism design with investment
Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
On the product knapsack problem
Lifting cover inequalities for the robust knapsack problem
-optimization schemes and L-bit precision: alternative perspectives for solving combinatorial optimization problems
A Modified Binary Particle Swarm Optimization for Knapsack Problems
Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
A heuristic for the problem of one-dimensional steel coil cutting
Qualitative programming for selection decisions
Exact solution techniques for two-dimensional cutting and packing
Optimal Individualized Decision Rules Using Instrumental Variable Methods
A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
The robust bilevel selection problem
Progress in presolving for mixed integer programming
Solving hard bi-objective knapsack problems using deep reinforcement learning
Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
Average sensitivity of the knapsack problem
Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Two-row and two-column mixed-integer presolve using hashing-based pairing methods
A new class of hard problem instances for the 0-1 knapsack problem
Random knapsack in expected polynomial time
Delay-constrained minimum shortest path trees and related problems
Delay-constrained minimum shortest path trees and related problems
An integrated disaster preparedness model for retrofitting and relief item transportation
Discrete optimization: a quantum revolution?
Knapsack polytopes: a survey
Solving TSP through the integration of OR and CP techniques
Faster Pseudopolynomial Time Algorithms for Subset Sum
Representability in mixed integer programming. I: Characterization results
Assortment optimization under the multinomial logit choice model with product-specific capacities
Adaptive refinement strategies for the simulation of gas flow in networks using a model hierarchy
A matheuristic approach to the orienteering problem with service time dependent profits
CON due-date determination and sequencing
George Dantzig's contributions to integer programming
Finding representations for an unconstrained bi-objective combinatorial optimization problem
Single-vendor multi-buyer inventory coordination under private information
An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
Piece selection algorithms for layered video streaming in P2P networks
A theory of learning with corrupted labels
Optimal individualized treatments in resource-limited settings
A surrogate heuristic for set covering problems
Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
On relocation problems with multiple identical working crews
Letter to the editor: Comment on Dantzig's paper on discrete variable extremum problems
Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
The service rate region polytope
A multi-period renewal equipment problem
An upper bound for the zero-one knapsack problem and a branch and bound algorithm
Bounds on the objective value of feasible roundings
When human visual performance is imperfect -- how to optimize the collaboration between one human operator and multiple field robots
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
Meso-parametric value function approximation for dynamic customer acceptances in delivery routing
Geometric quadrisection in linear time, with application to VLSI placement
The stochastic bilevel selection 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
On inner independence systems
Bookings in the European gas market: characterisation of feasibility and computational complexity results
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs
Representability of functions
Solving LP relaxations of some NP-hard problems is as hard as solving any linear program
Lagrangian heuristics for the quadratic knapsack problem
On the hardness of bribery variants in voting with CP-nets
Decentral allocation planning in multi-stage customer hierarchies
Simulation-optimization approaches for water pump scheduling and pipe replacement problems
Knapsack problems -- an overview of recent advances. I: Single knapsack problems
Exact algorithms for the 0-1 time-bomb knapsack problem
A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
The problem of maximum flow with minimum attainable cost in a network
Domain-independent dynamic programming

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)