Pages that link to "Item:Q813968"

The following pages link to Exact solution of a class of nonlinear knapsack problems (Q813968):

Displaying 19 items.

• Bandwidth packing problem with queueing delays: modelling and exact solution approach (Q312479) (← links)
• Efficient solution of a class of location-allocation problems with stochastic demand and congestion (Q337037) (← links)
• Modeling time allocation for prevention in primary care (Q623773) (← links)
• Exact approaches for competitive facility location with discrete attractiveness (Q828655) (← links)
• Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion (Q1639271) (← links)
• Service system design with immobile servers, stochastic demand and concave-cost capacity selection (Q1652604) (← links)
• Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
• The packing while traveling problem (Q1751654) (← links)
• Alternate solution approaches for competitive hub location problems (Q2029306) (← links)
• A branch and price approach for the robust bandwidth packing problem with queuing delays (Q2070728) (← links)
• Fractional 0-1 programming and submodularity (Q2162513) (← links)
• Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
• The maximum ratio clique problem (Q2356159) (← links)
• A cutting plane approach to combinatorial bandwidth packing problem with queuing delays (Q2361145) (← links)
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120) (← links)
• Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
• Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees (Q6068703) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)
• Modeling and solving an economies‐of‐scale service system design problem (Q6187314) (← links)