Solving 0-1 programming problems by a penalty approach.
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3495856 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- A shortest path algorithm for a nonrotating object among obstacles of arbitrary shapes
- An Automatic Method of Solving Discrete Programming Problems
- Gomory cuts revisited
- Integer linear programming formulation for a vehicle routing problem
- Introduction to global optimization
- On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
- Outline of an algorithm for integer solutions to linear programs
- Stochastic global optimization methods part I: Clustering methods
This page was built for publication: Solving 0-1 programming problems by a penalty approach.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468556)
