Partitioning procedures for solving mixed-variables programming problems.

J.F. BENDERS

Numerische Mathematik (1962/63)

  • Volume: 4, page 238-252
  • ISSN: 0029-599X; 0945-3245/e

How to cite

top

BENDERS, J.F.. "Partitioning procedures for solving mixed-variables programming problems.." Numerische Mathematik 4 (1962/63): 238-252. <http://eudml.org/doc/131533>.

@article{BENDERS1962/63,
author = {BENDERS, J.F.},
journal = {Numerische Mathematik},
keywords = {applications of probability theory and statistics},
pages = {238-252},
title = {Partitioning procedures for solving mixed-variables programming problems.},
url = {http://eudml.org/doc/131533},
volume = {4},
year = {1962/63},
}

TY - JOUR
AU - BENDERS, J.F.
TI - Partitioning procedures for solving mixed-variables programming problems.
JO - Numerische Mathematik
PY - 1962/63
VL - 4
SP - 238
EP - 252
KW - applications of probability theory and statistics
UR - http://eudml.org/doc/131533
ER -

Citations in EuDML Documents

top
  1. J. Tergny, Programmation linéaire mixte : conditions de validité dans les méthodes arborescentes
  2. Gary J. Kœhler, Andrew B. Whinston, Gordon P. Wright, Fixed cost minimization over a Leontief substitution system
  3. A. Quilliot, Décomposition en matrices graphiques de matrices en { 0 , 1 , - 1 } : application à la résolution de programmes linéaires entiers
  4. Maxime Ogier, Van-Dat Cung, Julien Boissière, Service network design in short and local fresh food supply chain
  5. Alain Quilliot, Fatiha Bendali, Jean Mailfert, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
  6. Hadrien Cambazard, Narendra Jussien, Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
  7. Alain Quilliot, Fatiha Bendali, Jean Mailfert, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
  8. Hadrien Cambazard, Narendra Jussien, Des explications pour reconnaître et exploiter les structures cachées d’un problème combinatoire
  9. Jaroslav Hrouda, The Benders method and parametrization of the right-hand sides in the mixed integer linear programming problem
  10. M. Minoux, E. Pinson, Lower bounds to the graph partitioning problem through generalized linear programming and network flows

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.