Surrogate Constraint Duality in Mathematical Programming
From MaRDI portal
Publication:4074702
DOI10.1287/opre.23.3.434zbMath0314.90093OpenAlexW1981134802MaRDI QIDQ4074702
Publication date: 1975
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.23.3.434
Related Items
A heuristic routine for solving large loading problems, On using approximations of the Benders master problem, On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems, Exact solution method to solve large scale integer quadratic multidimensional knapsack problems, A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem, Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems, Surrogate duality in a branch-and-bound procedure for integer programming, On the complexity of the surrogate dual of 0–1 programming, Constraint aggregation principle in convex optimization, Hybrid approaches for the two-scenario max-min knapsack problem, A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism, Probabilistic diversification and intensification in local search for vehicle routing, Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach, Matheuristics: survey and synthesis, State partitioning based linear program for stochastic dynamic programs: an invariance property, On the robust shortest path problem., A solution procedure for general knapsack problems with a few constraints, Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes, A surrogate and Lagrangian approach to constrained network problems, Mixed logical-linear programming, The multidimensional 0-1 knapsack problem: an overview., Surrogate duality relaxation for job shop scheduling, A relax-and-cut algorithm for the set partitioning problem, Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem, AN IMPROVED REDUCTION METHOD FOR THE ROBUST OPTIMIZATION OF THE ASSIGNMENT PROBLEM, An enhanced logarithmic method for signomial programming with discrete variables, On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints, Profit-based FMS dynamic part type selection over time for mid-term production planning, Zero duality gap in surrogate constraint optimization: a concise review of models, An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem, A simple procedure for solving a continuous quadratic mathematical model., Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem, Improved convergent heuristics for the 0-1 multidimensional knapsack problem, Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning», Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, Surrogate constraint normalization for the set covering problem, A o(n logn) algorithm for LP knapsacks with GUB constraints, Some relationships between lagrangian and surrogate duality in integer programming, Workface planning in synchronous production systems, A new approach based on the surrogating method in the project time compression problems, Simple and fast surrogate constraint heuristics for the maximum independent set problem, An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core, Deterministic job-shop scheduling: Past, present and future, A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem, On the complexity of surrogate and group relaxation for integer linear programs, Development of a new approach for deterministic supply chain network design, An enumerative algorithm framework for a class of nonlinear integer programming problems, Calculating surrogate constraints, An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem, A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem, Johri's general dual, the Lagrangian dual, and the surrogate dual, On surrogating 0-1 knapsack constraints, A note on constraint aggregation and value functions for two-stage stochastic integer programs, On the augmented Lagrangian dual for integer programming, Zero-one integer programs with few contraints - lower bounding theory, Revisiting surrogate relaxation for the multidimensional knapsack problem, Multicriteria integer programming: A (hybrid) dynamic programming recursive approach, Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems, On generalized surrogate duality in mixed-integer nonlinear programming, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
