Pages that link to "Item:Q3919449"
From MaRDI portal
The following pages link to The Lagrangian Relaxation Method for Solving Integer Programming Problems (Q3919449):
Displaying 50 items.
- Experimentation in optimization (Q1084342) (← links)
- Implementation techniques for the vehicle routing problem (Q1086140) (← links)
- A Lagrangean relaxation method for the constrained assignment problem (Q1086162) (← links)
- A new Lagrangian relaxation approach to the generalized assignment problem (Q1088908) (← links)
- A computational evaluation of two subgradient search methods (Q1089257) (← links)
- Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms (Q1096544) (← links)
- Hierarchical approach to the process planning problem (Q1097828) (← links)
- An algorithm for solving large capacitated warehouse location problems (Q1099067) (← links)
- Surrogate duality in a branch-and-bound procedure for integer programming (Q1099783) (← links)
- A large-scale multilocation capacity planning model (Q1101333) (← links)
- A shadow price in integer programming for management decision (Q1107446) (← links)
- Maximal chordal subgraphs (Q1115455) (← links)
- An improved direct descent algorithm for binary knapsack problems (Q1115799) (← links)
- Application of Lagrangian relaxation to computer network control (Q1118382) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- Lagrangian dual ascent by generalized linear programming (Q1123118) (← links)
- Design of electronic assembly lines: An analytical framework and its application (Q1124682) (← links)
- The scheduling problem where multiple machines compete for a common local buffer (Q1127173) (← links)
- A fixed interval due-date scheduling problem with earliness and due-date costs (Q1127177) (← links)
- An integrated model for the development of marginal water sources in the Negev Desert (Q1130021) (← links)
- A heuristic decomposition approach to optimal control in a water supply model (Q1167069) (← links)
- An algorithm for single machine sequencing with deadlines to minimize total weighted completion time (Q1170111) (← links)
- Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
- The design of multiactivity multifacility systems (Q1171982) (← links)
- Locational analysis (Q1173002) (← links)
- The hierarchical network design problem with transshipment facilities (Q1178636) (← links)
- Lagrangean decomposition for integer nonlinear programming with linear constraints (Q1181738) (← links)
- A solution procedure for the file allocation problem with file availability and response time (Q1184448) (← links)
- The \(K\)-coverage concentrator location problem (Q1193145) (← links)
- Flow network design for manufacturing systems layout (Q1197683) (← links)
- Integrating facility layout with process selection and capacity planning (Q1197685) (← links)
- Configuration of fully replicated distributed database system over wide area networks (Q1197781) (← links)
- Locating concentrators in centralized computer networks (Q1197789) (← links)
- Relaxations for probabilistically constrained programs with discrete random variables (Q1197883) (← links)
- A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints (Q1198141) (← links)
- Capacitated lot-sizing and scheduling by Lagrangean relaxation (Q1198326) (← links)
- A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
- Scheduling examinations to reduce second-order conflicts (Q1200827) (← links)
- Lagrangian approach for large-scale least absolute value estimation (Q1201859) (← links)
- A decomposition technique for mixed integer programming problems (Q1206388) (← links)
- A scheduling model for the daily operation of an electric power system (Q1208806) (← links)
- An integrated approach to the part selection and machine loading problem in a class of flexible manufacturing systems (Q1261329) (← links)
- File allocation involving worst case response times and link capacities: Model and solution procedure (Q1261331) (← links)
- A due date assignment algorithm for multiproduct manufacturing facilities (Q1261379) (← links)
- A survey of algorithms for the single machine total weighted tardiness scheduling problem (Q1262207) (← links)
- Facilities location in a competitive environment: A Promethee based multiple criteria analysis (Q1264086) (← links)
- Resource constrained assignment problems (Q1264090) (← links)
- Partial termination rule of Lagrangian relaxation for manufacturing cell formation problems (Q1265849) (← links)
- Conditional subgradient optimization -- theory and applications (Q1266608) (← links)
- An adaptation of SH heuristic to the location set covering problem (Q1278140) (← links)
