Pages that link to "Item:Q3325464"
From MaRDI portal
The following pages link to Surrogate Dual Multiplier Search Procedures in Integer Programming (Q3325464):
Displaying 25 items.
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints (Q693550) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Exploiting nested inequalities and surrogate constraints (Q858413) (← links)
- A trust region method for the solution of the surrogate dual in integer programming (Q896175) (← links)
- The equity constrained shortest path problem (Q910348) (← links)
- A surrogate and Lagrangian approach to constrained network problems (Q920831) (← links)
- Surrogate duality in a branch-and-bound procedure for integer programming (Q1099783) (← links)
- Aggregation of constraints in integer programming (Q1108194) (← links)
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs (Q1110459) (← links)
- Profit-based FMS dynamic part type selection over time for mid-term production planning (Q1206598) (← links)
- An enumerative algorithm framework for a class of nonlinear integer programming problems (Q1278943) (← links)
- On using approximations of the Benders master problem (Q1333479) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach (Q1389081) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- On the complexity of surrogate and group relaxation for integer linear programs (Q2060595) (← links)
- Revisiting surrogate relaxation for the multidimensional knapsack problem (Q2102833) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- Zero duality gap in surrogate constraint optimization: a concise review of models (Q2255935) (← links)
- RAMP for the capacitated minimum spanning tree problem (Q2430627) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- Distance confined path problem and separable integer programming (Q2841138) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
