Pages that link to "Item:Q3780006"

The following pages link to Lagrangean decomposition for integer programming : theory and applications (Q3780006):

Displaying 18 items.

• An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
• A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
• Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
• Lagrangean decomposition for integer nonlinear programming with linear constraints (Q1181738) (← links)
• Solving makespan minimization problems with Lagrangean decomposition (Q1209146) (← links)
• The return plant location problem: Modelling and resolution (Q1291663) (← links)
• An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem (Q1309925) (← links)
• A Lagrangean decomposition solution to a single line multiproduct scheduling problem (Q1342036) (← links)
• A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973) (← links)
• Polyhedral analysis and decompositions for capacitated plant location-type problems (Q1383369) (← links)
• Facility location with increasing production costs (Q1869420) (← links)
• Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
• \(\gamma\)-robust facility relocation problem (Q2355805) (← links)
• A primal-proximal heuristic applied to the French unit-commitment problem (Q2571007) (← links)
• A novel analytical integer optimization method for wavelet based subband coding (Q2798128) (← links)
• The multi-hour service system design problem (Q5925868) (← links)