Pages that link to "Item:Q384665"

The following pages link to Method of sequential modification of the objective function in the assignment problem (Q384665):

Displaying 10 items.

• The recurrent method to solve the assignment problem (Q269147) (← links)
• A note of reduced dimension optimization algorithm of assignment problem (Q887868) (← links)
• Goal programming in the context of the assignment problem and a computationally effective solution method (Q929411) (← links)
• Modified branch-and-bound method for solving a series of problems (Q1113803) (← links)
• Method for solving a convex integer programming problem (Q1415135) (← links)
• Decomposition method for solving a three-index planar assignment problem (Q1995353) (← links)
• Decomposition method for solving the three-index problem of effective shooting (Q2695088) (← links)
• The partial orthogonalization process and its application to the optimal assignment problem (Q2706804) (← links)
• A new method of solving assignment problems -- the target value submatrix method (Q3017061) (← links)
• Assignments with sequencing constraints (Q3989095) (← links)