scientific article

From MaRDI portal
Publication:3835301

zbMath0678.90061MaRDI QIDQ3835301

Yvon Mahieu, Paul Chaillou, Pierre Hansen

Publication date: 1989


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

A column generation approach to job grouping for flexible manufacturing systems, 0-1 quadratic knapsack problem solved with VNS algorithm, Generalized quadratic multiple knapsack problem and two solution approaches, Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems, On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, The quadratic knapsack problem -- a survey, A cut-and-branch algorithm for the quadratic knapsack problem, A lifted-space dynamic programming algorithm for the quadratic knapsack problem, A general purpose exact solution method for mixed integer concave minimization problems, A Dynamic Programming Heuristic for the Quadratic Knapsack Problem, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, On reduction of duality gap in quadratic knapsack problems, A Lagrangian relaxation approach to the edge-weighted clique problem, An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem, Upper bounds and exact algorithms for \(p\)-dispersion problems, Lagrangian heuristics for the quadratic knapsack problem, A new upper bound for the 0-1 quadratic knapsack problem, Linear programming for the \(0-1\) quadratic knapsack problem, Lagrangean methods for the 0-1 quadratic knapsack problem, Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1, Combinatorial optimization models for production scheduling in automated manufacturing systems, On the supermodular knapsack problem, A matheuristic for the 0--1 generalized quadratic multiple knapsack problem, Parametric convex quadratic relaxation of the quadratic knapsack problem, The polynomial robust knapsack problem, The quadratic 0-1 knapsack problem with series-parallel support