Pages that link to "Item:Q4285173"
From MaRDI portal
The following pages link to Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem (Q4285173):
Displaying 3 items.
- A new necessary and sufficient global optimality condition for canonical DC problems (Q1945515) (← links)
- 0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices (Q2001133) (← links)
- A new approach based on the surrogating method in the project time compression problems (Q2507391) (← links)