Pages that link to "Item:Q3196615"

The following pages link to Convex quadratic and semidefinite programming relaxations in scheduling (Q3196615):

Displaying 41 items.

• Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
• CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
• Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
• Approximation algorithms for indefinite complex quadratic maximization problems (Q625875) (← links)
• Scheduling with earliness-tardiness penalties and parallel machines (Q941007) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• An approximate algorithm for a high-multiplicity parallel machine scheduling problem (Q991471) (← links)
• A study of the quadratic semi-assignment polytope (Q1013294) (← links)
• Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems (Q1026110) (← links)
• Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
• An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
• The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
• Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← links)
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
• Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints (Q2108178) (← links)
• Scheduling equal length jobs with eligibility restrictions (Q2288997) (← links)
• A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
• An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
• Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
• Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
• An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
• Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Unrelated parallel machine scheduling with new criteria: complexity and models (Q2668730) (← links)
• Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
• Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512) (← links)
• Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
• Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Q5131543) (← links)
• Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
• An exact quadratic programming approach based on convex reformulation for <i>seru</i> scheduling problems (Q6078600) (← links)
• Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines (Q6126818) (← links)