Pages that link to "Item:Q5712452"
From MaRDI portal
The following pages link to Integer Programming and Combinatorial Optimization (Q5712452):
Displaying 11 items.
- Integer-programming software systems (Q817202) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- A multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116) (← links)
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← links)
- Transmission network investment using incentive regulation: a disjunctive programming approach (Q2031209) (← links)
- Dealing with time in the multiple traveling salespersons problem with moving targets (Q2155136) (← links)
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange (Q2289919) (← links)
- Irreducible infeasible subsystems of semidefinite systems (Q2420811) (← links)
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (Q2459384) (← links)
- Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity (Q5086014) (← links)
- Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm (Q6164624) (← links)