Pages that link to "Item:Q5181541"

The following pages link to Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program (Q5181541):

Displaying 17 items.

• The Boolean Quadric Polytope (Q5050144) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization (Q5084606) (← links)
• Closed loop supply chain mathematical modeling considering lean agile resilient and green strategies (Q5147663) (← links)
• Multi-period maintenance scheduling of tree networks with minimum flow disruption (Q5198690) (← links)
• A revised Taha's algorithm for polynomial 0-1 programming (Q5426969) (← links)
• An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines (Q5696463) (← links)
• A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)
• Advanced network connectivity features and zonal requirements in covering location problems (Q6047840) (← links)
• Solving multiplicative programs by binary-encoding the multiplication operation (Q6047881) (← links)
• Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
• An exact cutting plane method for the Euclidean max-sum diversity problem (Q6096568) (← links)
• Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation (Q6110962) (← links)
• On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903) (← links)
• Shortest paths with exclusive-disjunction arc pairs conflicts (Q6164356) (← links)
• Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem (Q6180050) (← links)
• Inductive linearization for binary quadratic programs with linear constraints: a computational study (Q6489313) (← links)