The following pages link to (Q5850736):
Displayed 12 items.
- The traveling salesman problem with flexible coloring (Q444446) (← links)
- A new procedure for solving integer linear programming problems (Q1639913) (← links)
- Integer linear programming models for grid-based light post location problem (Q1926907) (← links)
- Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
- A separation algorithm for the simple plant location problem (Q2060615) (← links)
- A shadow-test approach to adaptive item calibration (Q2220367) (← links)
- A Davidson college multi-objective assignment problem: a case study (Q2257101) (← links)
- Capacitated refueling station location problem with traffic deviations over multiple time periods (Q2358103) (← links)
- Multicriteria energy policy investments and energy market clearance via integer programming (Q2358157) (← links)
- Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming (Q2829954) (← links)
- Selection of balanced portfolios to track the main properties of a large market (Q4683015) (← links)
- The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm (Q4995073) (← links)