Surrogate Constraints
From MaRDI portal
Publication:5550289
DOI10.1287/opre.16.4.741zbMath0165.22602OpenAlexW4232237275MaRDI QIDQ5550289
Publication date: 1968
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/56b713eda821d08c764ea36f00047f47f4aefe3c
Related Items
A heuristic routine for solving large loading problems, On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, A surrogate cutting plane algorithm for all-integer programming, Computing an upper bound on contact stress with surrogate duality, A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings, On the complexity of the surrogate dual of 0–1 programming, Generating cutting planes for the semidefinite relaxation of quadratic programs, Exploiting nested inequalities and surrogate constraints, A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem, Layering strategies for creating exploitable structure in linear and integer programs, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, A surrogate hyperplane Kaczmarz method for solving consistent linear equations, State partitioning based linear program for stochastic dynamic programs: an invariance property, A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem, A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement, Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, An implicit enumeration program for zero-one integer programming, Resolution of the 0–1 knapsack problem: Comparison of methods, The multidimensional 0-1 knapsack problem: an overview., Surrogate duality relaxation for job shop scheduling, A survey on the continuous nonlinear resource allocation problem, Maximum-entropy approach in linear programs., Quasiconvex duality theory by generalized conjugation methods, Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints, Multi-phase dynamic constraint aggregation for set partitioning type problems, Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem, Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, Surrogate constraint normalization for the set covering problem, Active-constraint variable ordering for faster feasibility of mixed integer linear programs, Solving large-scale linear programs by aggregation, Unnamed Item, Computational experience with an algorithm for 0-1 integer programming, A rough set approach to feature selection based on scatter search metaheuristic, Deterministic job-shop scheduling: Past, present and future, Lagrangean/surrogate relaxation for generalized assignment problems, Implied constraints and an alternate unified development of nonlinear programming theory, Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming, Relaxation heuristics for a generalized assignment problem, An enumerative algorithm framework for a class of nonlinear integer programming problems, Calculating surrogate constraints, Heuristics for the 0-1 multidimensional knapsack problem, 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, Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds, Smart greedy procedure for solving a multidimensional nonlinear knapsack class of reliability optimization problems., Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems, Implied constraints and a unified theory of duality in linear and nonlinear programming, On generalized surrogate duality in mixed-integer nonlinear programming, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
