Surrogate Mathematical Programming
From MaRDI portal
Cited in
(80)- Simple and fast surrogate constraint heuristics for the maximum independent set problem
- Development of a new approach for deterministic supply chain network design
- Zero-one integer programs with few contraints - lower bounding theory
- Surrogate dual problems and surrogate Lagrangians
- A general theory of dual optimization problems
- A general theory of surrogate dual and perturbational extended surrogate dual optimization problems
- Abstract subdifferentials and some characterizations of optimal solutions
- Surrogate duality in a branch-and-bound procedure for integer programming
- The scheduling problem where multiple machines compete for a common local buffer
- A parallel iterative algorithm for structural optimization
- Correction to an article of Gavish and Pirkul
- A duality approach to minimax results for quasi-saddle functions in finite dimensions
- Configuration of fully replicated distributed database system over wide area networks
- Implied constraints and an alternate unified development of nonlinear programming theory
- An adaptation of SH heuristic to the location set covering problem
- An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
- On surrogating 0-1 knapsack constraints
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- Implied constraints and a unified theory of duality in linear and nonlinear programming
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- On using approximations of the Benders master problem
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
- The multidimensional 0-1 knapsack problem: an overview.
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
- Lagrangean/surrogate relaxation for generalized assignment problems
- Johri's general dual, the Lagrangian dual, and the surrogate dual
- Dual-based heuristics for a hierarchical covering location problem
- Diewert-Crouzeix conjugation for general quasiconvex duality and applications
- State partitioning based linear program for stochastic dynamic programs: an invariance property
- On the complexity of surrogate and group relaxation for integer linear programs
- Revisiting surrogate relaxation for the multidimensional knapsack problem
- On generalized surrogate duality in mixed-integer nonlinear programming
- Duality for quasiconvex minimization over closed convex cones
- Some remarks on Greenberg-Pierskalla subdifferentiability of quasiconvex functions
- Duality theorems for convex and quasiconvex set functions
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Surrogate duality for robust optimization
- Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution
- A survey on the continuous nonlinear resource allocation problem
- A relax-and-cut algorithm for the set partitioning problem
- Maximum-entropy approach in linear programs.
- Duality in mathematics and linear and integer programming
- Computing an upper bound on contact stress with surrogate duality
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
- A maximum entropy method for a robust portfolio problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- On the complexity of the surrogate dual of 0–1 programming
- A convex-like duality scheme for quasi-convex programs
- Surrogate duality for vector optimization
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Quasiconvex duality theory by generalized conjugation methods
- A o(n logn) algorithm for LP knapsacks with GUB constraints
- Some relationships between lagrangian and surrogate duality in integer programming
- Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual
- Calculating surrogate constraints
- An elementary survey of general duality theory in mathematical programming
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Duality for quasi-concave programs with application to economics
- Surrogate Constraints in Integer Programming
- Necessary and sufficient constraint qualification for surrogate duality
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- On generalized surrogate duality in mixed-integer nonlinear programming
- On the existence of duality gaps for mixed integer programming
- Penalty function versus non-penalty function methods for constrained nonlinear programming problems
- Solving large-scale linear programs by aggregation
- Matheuristics: survey and synthesis
- Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation
- A surrogate-based heuristic for production planning problem of orders in small foundries
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
- Contemporary approaches in matheuristics an updated survey
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- Aggregation of bilinear bipartite equality constraints and its application to structural model updating problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Exploiting nested inequalities and surrogate constraints
- A trust region method for the solution of the surrogate dual in integer programming
- A surrogate and Lagrangian approach to constrained network problems
- Surrogate constraint normalization for the set covering problem
This page was built for publication: Surrogate Mathematical Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5641028)