Pages that link to "Item:Q2501114"
From MaRDI portal
The following pages link to Towards strong duality in integer programming (Q2501114):
Displaying 30 items.
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- Cluster Lagrangean decomposition in multistage stochastic optimization (Q342253) (← links)
- Feasibility in reverse convex mixed-integer programming (Q439456) (← links)
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
- Reachability determination in acyclic Petri nets by cell enumeration approach (Q644287) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- An exact algorithm for cost minimization in series reliability systems with multiple component choices (Q945416) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- Solution approaches for highly primal- and dual-degenerate all-integer programming problems (Q1085064) (← links)
- Lagrangean duality for facial programs with applications to integer and complementarity problems (Q1196216) (← links)
- Relaxations and heuristics for the multiple non-linear separable knapsack problem (Q1652581) (← links)
- Convex analysis and duality over discrete domains (Q1660291) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- On strong duality in linear copositive programming (Q2149604) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Stacking sequence and shape optimization of laminated composite plates via a level-set method (Q2208621) (← links)
- Zero duality gap in surrogate constraint optimization: a concise review of models (Q2255935) (← links)
- Joint optimization of product family configuration and scaling design by Stackelberg game (Q2255949) (← links)
- Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208) (← links)
- A semi-supervised random vector functional-link network based on the transductive framework (Q2282876) (← links)
- On the augmented Lagrangian dual for integer programming (Q2340340) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- A stochastic algorithm for probabilistic independent component analysis (Q2428739) (← links)
- Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness (Q2668664) (← links)
- Strong duality in optimization: shifted power reformulation (Q2829558) (← links)
- Multiple cost coefficients sensitivity theorems of integer linear optimization (Q5039396) (← links)
- (Q5453756) (← links)
- Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method. (Q5928425) (← links)
- On Taxicab Distance Mean Functions and their Geometric Applications: Methods, Implementations and Examples (Q6048185) (← links)
