The following pages link to Surrogate Constraints (Q5550289):
Displaying 50 items.
- A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings (Q316165) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing (Q439361) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- Solving large-scale linear programs by aggregation (Q581234) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- A rough set approach to feature selection based on scatter search metaheuristic (Q741887) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Exploiting nested inequalities and surrogate constraints (Q858413) (← links)
- A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement (Q900590) (← links)
- Multi-phase dynamic constraint aggregation for set partitioning type problems (Q964175) (← links)
- Surrogate constraint normalization for the set covering problem (Q976352) (← links)
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
- Heuristics for the 0-1 multidimensional knapsack problem (Q1042198) (← links)
- A surrogate cutting plane algorithm for all-integer programming (Q1086159) (← links)
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem (Q1108931) (← links)
- Layering strategies for creating exploitable structure in linear and integer programs (Q1117840) (← links)
- Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
- Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung (Q1217449) (← links)
- Computational experience with an algorithm for 0-1 integer programming (Q1256963) (← links)
- Implied constraints and an alternate unified development of nonlinear programming theory (Q1266624) (← links)
- Relaxation heuristics for a generalized assignment problem (Q1278258) (← links)
- An enumerative algorithm framework for a class of nonlinear integer programming problems (Q1278943) (← links)
- An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem (Q1291694) (← links)
- Implied constraints and a unified theory of duality in linear and nonlinear programming (Q1319546) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem (Q1577777) (← links)
- Smart greedy procedure for solving a multidimensional nonlinear knapsack class of reliability optimization problems. (Q1597095) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints (Q1751662) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming (Q1821036) (← links)
- State partitioning based linear program for stochastic dynamic programs: an invariance property (Q1939695) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Maximum-entropy approach in linear programs. (Q2468601) (← links)
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds (Q2569064) (← links)
- Computing an upper bound on contact stress with surrogate duality (Q2630814) (← links)
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
- On the complexity of the surrogate dual of 0–1 programming (Q3725870) (← links)
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs (Q3757690) (← links)
- Quasiconvex duality theory by generalized conjugation methods (Q3824934) (← links)
- Calculating surrogate constraints (Q3916382) (← links)
- A heuristic routine for solving large loading problems (Q3962774) (← links)
- Resolution of the 0–1 knapsack problem: Comparison of methods (Q4074670) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- (Q5659341) (← links)
