The following pages link to (Q3137912):
Displaying 19 items.
- A brief history of the international symposia on mathematical programming (Q607500) (← links)
- Polarity and the complexity of the shooting experiment (Q951126) (← links)
- Team-maxmin equilibria (Q1378009) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- A concise characterization of strong knapsack facets (Q1634771) (← links)
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints (Q1751215) (← links)
- Chvatal--Gomory--tier cuts for general integer programs (Q1779688) (← links)
- Investment evaluation based on the commerical scope. The production of natural gas (Q1904680) (← links)
- The power of linear programming: some surprising and unexpected LPs (Q2040605) (← links)
- A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Three is easy, two is hard: Open shop sum-batch scheduling problem refined (Q2466597) (← links)
- Gomory cuts revisited (Q2564234) (← links)
- How mathematical impossibility changed welfare economics: a history of Arrow's impossibility theorem (Q2631822) (← links)
- Applications of matroids in electric network theory (Q4999339) (← links)
- A Multiple Perspective Approach to History of Mathematics: Mathematical Programming and Rashevsky’s Early Development of Mathematical Biology in the Twentieth Century (Q5241555) (← links)
- Book Review: The basic George B. Dantzig (Q5494765) (← links)
- A contextualized historical analysis of the Kuhn-Tucker theorem in nonlinear programming: The impact of World War II (Q5928388) (← links)
- Foundations of operations research: from linear programming to data envelopment analysis (Q6106760) (← links)
