Pages that link to "Item:Q1969889"
From MaRDI portal
The following pages link to Conflict graphs in solving integer programming problems (Q1969889):
Displayed 14 items.
- Automated knowledge source selection and service composition (Q453606) (← links)
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580) (← links)
- Strong formulation for the spot 5 daily photograph scheduling problem (Q613663) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
- A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem (Q991376) (← links)
- A decomposition approach for the probabilistic maximal covering location-allocation problem (Q1017444) (← links)
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. (Q1410308) (← links)
- The maximum common edge subgraph problem: A polyhedral investigation (Q1759826) (← links)
- On identifying dominant cliques. (Q1811147) (← links)
- Conflict analysis in mixed integer programming (Q2471271) (← links)
- A LP-based heuristic for a time-constrained routing problem (Q2491773) (← links)
- A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems (Q2883604) (← links)
- A branch-and-cut algorithm for the maximum cardinality stable set problem (Q5940036) (← links)