The following pages link to (Q5462193):
Displaying 15 items.
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
- A branch-and-cut algorithm for the latent-class logit assortment problem (Q496669) (← links)
- Finding checkerboard patterns via fractional 0-1 programming (Q604870) (← links)
- Scheduling tasks with exponential duration on unrelated parallel machines (Q714038) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780) (← links)
- A geometric branch-and-bound algorithm for the service bundle design problem (Q2160490) (← 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 global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120) (← links)
- Feature selection for consistent biclustering via fractional 0-1 programming (Q2576438) (← links)
- A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem (Q2883584) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
